Model-Checking of Ordered Multi-Pushdown Automata

We address the verification problem of ordered multi-pushdown automata: A multi-stack extension of pushdown automata that comes with a constraint on stack transitions such that a pop can only be performed on the first non-empty stack. First, we show that the emptiness problem for ordered multi-pushdown automata is in 2ETIME. Then, we prove that, for an ordered multi-pushdown automata, the set of all predecessors of a regular set of configurations is an effectively constructible regular set. We exploit this result to solve the global model-checking which consists in computing the set of all configurations of an ordered multi-pushdown automaton that satisfy a given w-regular property (expressible in linear-time temporal logics or the linear-time \mu-calculus). As an immediate consequence, we obtain an 2ETIME upper bound for the model-checking problem of w-regular properties for ordered multi-pushdown automata (matching its lower-bound).Comment: 31 page

Approximating Petri Net Reachability Along Context-free Traces

We investigate the problem asking whether the intersection of a context-free language (CFL) and a Petri net language (PNL) is empty. Our contribution to solve this long-standing problem which relates, for instance, to the reachability analysis of recursive programs over unbounded data domain, is to identify a class of CFLs called the finite-index CFLs for which the problem is decidable. The k-index approximation of a CFL can be obtained by discarding all the words that cannot be derived within a budget k on the number of occurrences of non-terminals. A finite-index CFL is thus a CFL which coincides with its k-index approximation for some k. We decide whether the intersection of a finite-index CFL and a PNL is empty by reducing it to the reachability problem of Petri nets with weak inhibitor arcs, a class of systems with infinitely many states for which reachability is known to be decidable. Conversely, we show that the reachability problem for a Petri net with weak inhibitor arcs reduces to the emptiness problem of a finite-index CFL intersected with a PNL.Comment: 16 page

An improvement of a cellular manufacturing system design using simulation analysis

Cell Formation (CF) problem involves grouping the parts into part families and machines into manufacturing cells, so that parts with similar processing requirements are manufactured within the same cell. Many researches have suggested methods for CF. Few of these methods; have addressed the possible existence of exceptional elements (EE) in the solution and the effect of correspondent intercellular movement, which cause lack of segregation among the cells. This paper presents a simulation-based methodology, which takes into consideration the stochastic aspect in the cellular manufacturing (CM) system, to create better cell configurations. An initial solution is developed using any of the numerous CF procedures. The objective of the proposed method which provides performances ratings and cost-effective consist in determine how best to deal with the remaining EE. It considers and compares two strategies (1) permitting intercellular transfer and (2) exceptional machine duplication. The process is demonstrated with a numerical exampleCell Formation; Exceptional Elements; Simulation; Alternative costs; Improvement

A Taguchi method application for the part routing selection in Generalized Group Technology: A case Study

Cellular manufacturing (CM) is an important application of group technology (GT) that can be used to enhance both flexibility and efficiency in today’s small-to-medium lot production environment. The crucial step in the design of a CM system is the cell formation (CF) problem which involves grouping parts into families and machines into cells. The CF problem are increasingly complicated if parts are assigned with alternative routings (known as generalized Group Technology problem). In most of the previous works, the route selection problem and CF problem were formulated in a single model which is not practical for solving large-scale problems. We suggest that better solution could be obtained by formulating and solving them separately in two different problems. The aim of this case study is to apply Taguchi method for the route selection problem as an optimization technique to get back to the simple CF problem which can be solved by any of the numerous CF procedures. In addition the main effect of each part and analysis of variance (ANOVA) are introduced as a sensitivity analysis aspect that is completely ignored in previous research.Cellular Manufacturing; generalized Group Technology; route selection problem; Taguchi method; ANOVA; sensitivity analysis

Formation of machine groups and part families in cellular manufacturing systems using a correlation analysis approach

The important step in the design of a cellular manufacturing (CM) system is to identify the part families and machine groups and consequently to form manufacturing cells. The scope of this article is to formulate a multivariate approach based on a correlation analysis for solving cell formation problem. The proposed approach is carried out in three phases. In the first phase, the correlation matrix is used as similarity coefficient matrix. In the second phase, Principal Component Analysis (PCA) is applied to find the eigenvalues and eigenvectors on the correlation similarity matrix. A scatter plot analysis as a cluster analysis is applied to make simultaneously machine groups and part families while maximizing correlation between elements. In the third stage, an algorithm is improved to assign exceptional machines and exceptional parts using respectively angle measure and Euclidian distance. The proposed approach is also applied to the general Group Technology (GT) problem in which exceptional machines and part are considered. Furthermore, the proposed approach has the flexibility to consider the number of cells as a dependent or independent variable. Two numerical examples for the design of cell structures are provided in order to illustrate the three phases of proposed approach. The results of a comparative study based on multiple performance criteria show that the present approach is very effective, efficient and practical.cellular manufacturing; cell formation; correlation matrix; Principal Component Analysis; exceptional machines and parts

A New Combined Framework for the Cellular Manufacturing Systems Design

Cellular Manufacturing (CM) system has been recognized as an efficient and effective way to improve productivity in a factory. In recent years, there have been continuous research efforts to study different facet of CM system. The literature does not contain much published research on CM design which includes all design aspects. In this paper we provide a framework for the complete CM system design. It combines Axiomatic Design (AD) and Experimental Design (ED) to generate several feasible and potentially profitable designs. The AD approach is used as the basis for establishing a systematic CM systems design structure. ED has been a very useful tool to design and analyze complicated industrial design problems. AD helps secure valid input-factors to the ED. An element of the proposed framework is desmontrate through a numerical example for cell formation with alternative process.Cellular manufacturing; Design methodology Axiomatic Design; Experimental Design.

Adding Time to Pushdown Automata

In this tutorial, we illustrate through examples how we can combine two classical models, namely those of pushdown automata (PDA) and timed automata, in order to obtain timed pushdown automata (TPDA). Furthermore, we describe how the reachability problem for TPDAs can be reduced to the reachability problem for PDAs.Comment: In Proceedings QFM 2012, arXiv:1212.345

Zenoness for Timed Pushdown Automata

Timed pushdown automata are pushdown automata extended with a finite set of real-valued clocks. Additionaly, each symbol in the stack is equipped with a value representing its age. The enabledness of a transition may depend on the values of the clocks and the age of the topmost symbol. Therefore, dense-timed pushdown automata subsume both pushdown automata and timed automata. We have previously shown that the reachability problem for this model is decidable. In this paper, we study the zenoness problem and show that it is EXPTIME-complete.Comment: In Proceedings INFINITY 2013, arXiv:1402.661