Dynamic analysis of repetitive decision-free discreteevent processes: The algebra of timed marked graphs and algorithmic issues

A model to analyze certain classes of discrete event dynamic systems is presented. Previous research on timed marked graphs is reviewed and extended. This model is useful to analyze asynchronous and repetitive production processes. In particular, applications to certain classes of flexible manufacturing systems are provided in a companion paper. Here, an algebraic representation of timed marked graphs in terms of reccurrence equations is provided. These equations are linear in a nonconventional algebra, that is described. Also, an algorithm to properly characterize the periodic behavior of repetitive production processes is descrbed. This model extends the concepts from PERT/CPM analysis to repetitive production processes.

[1]  U. Zimmermann.  Linear and combinatorial optimization in ordered algebraic structures , 1981 .

[2]  Amir Pnueli,et al.  Marked Directed Graphs , 1971, J. Comput. Syst. Sci..

[3]  Raymond A. Cuninghame-Green,et al.  Projections in minimax algebra , 1976, Math. Program..

[4]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[5]  Marco Ajmone Marsan,et al.  Performance models of multiprocessor systems , 1987, MIT Press series in computer systems.

[6]  Marco Ajmone Marsan,et al.  A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems , 1984, TOCS.

[7]  Geert Jan Olsder,et al.  Cramer and Cayley-Hamilton in the max algebra , 1988 .

[8]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[9]  J. Quadrat,et al.  Linear system theory for discrete event systems , 1984, The 23rd IEEE Conference on Decision and Control.

[10]  Michel Gondran,et al.  Les elements p-reguliers dans les dioïdes , 1979, Discret. Math..

[11]  Cl. Guichard.  Théorie des réseaux , 1935 .

[12]  Didier Dubois,et al.  Using Petri nets to represent production processes , 1983, The 22nd IEEE Conference on Decision and Control.

[13]  B. Carré.  An Algebra for Network Routing Problems , 1971 .

[14]  Kathryn E. Stecke,et al.  Dynamic analysis of repetitive decision-free discrete-event processes: applications to production systems , 1991 .

[15]  J. Quadrat,et al.  A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.

[16]  C. V. Ramamoorthy,et al.  Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets , 1980, IEEE Transactions on Software Engineering.

[17]  P. Moller.  Théorême de Cayley-Hamilton dans les dioïdes et application à l’étude des sytèmes à évènements discrets , 1986 .

[18]  R. A. Cuninghame-Green,et al.  Describing Industrial Processes with Interference and Approximating Their Steady-State Behaviour , 1962 .

[19]  Stephen J. Garland,et al.  Algorithm 97: Shortest path , 1962, Commun. ACM.

[20]  Raymond Reiter,et al.  Scheduling Parallel Computations , 1968, J. ACM.

[21]  M. Gondran,et al.  Linear Algebra in Dioids: A Survey of Recent Results , 1984 .

[22]  G. Bel,et al.  A unified setting for various models of automated material flow and production systems , 1985 .

[23]  Masahiro Sowa,et al.  A Timed Petri Net Model and Simulation of a Dataflow Computer , 1985, PNPM.

[24]  G. Cohen,et al.  Dating and counting events in discrete-event systems , 1986, 1986 25th IEEE Conference on Decision and Control.

[25]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[26]  G. Dantzig,et al.  FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[27]  Michel Diaz,et al.  Modeling and Analysis of Communication and Cooperation Protocols Using Petri Net Based Models , 1982, Comput. Networks.

[28]  J. A. Buzacott,et al.  Flexible manufacturing systems: a review of analytical models , 1986 .