Dynamic process creation in high-level Petri nets

All existing Petri Net models have a static topology, i.e. the number of components and their interaction structure are fixed during the course of the modeled system. In this article, we investigate to what extent presently known high-level Petri Nets support the modeling of processes with a dynamic topology, i.e. a changing interaction structure and number of components. We finally present the DTN model, a high-level Petri Net model with time component, where existing processes can create new ones. Topics Dynamic process creation, relationships between net theory and other approaches, highlevel net models, timed nets.

[1]  Willem P. de Roever,et al.  Compositionality and Modularity in Process Specification and Design: A Trace-State Based Approach , 1987, Temporal Logic in Specification.

[2]  Niklaus Wirth,et al.  Pascal User Manual and Report , 1991, Springer New York.

[3]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[4]  van Km Kees Hee,et al.  Fasering en documentatie in software engineering , 1988 .

[5]  E. Z. Lepoeter-Molnar.  Reconstruction of a 3-D surface from its normal vectors , 1989 .

[6]  Wolfgang Reisig.  Place/Transition Systems , 1986, Advances in Petri Nets.

[7]  Peter Huber,et al.  Hierarchies in coloured Petri nets , 1991, Applications and Theory of Petri Nets.

[8]  Kurt Jensen.  Coloured Petri Nets , 1992, EATCS Monographs in Theoretical Computer Science.

[9]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[10]  van Km Kees Hee,et al.  Discrete event systems : concepts and basic results , 2001 .

[11]  van Km Kees Hee,et al.  Executable specifications for discrete event systems , 1988 .

[12]  Hartmann J. Genrich,et al.  Predicate/Transition Nets , 1986, Advances in Petri Nets.

[13]  Anders Gammelgaard.  Implementation Conditions for Delay Insensitive Circuits , 1989, PARLE.

[14]  Gul A. Agha,et al.  ACTORS - a model of concurrent computation in distributed systems , 1985, MIT Press series in artificial intelligence.

[15]  A. Kaldewaij.  A formalism for concurrent processes , 1986 .

[16]  Ron Koymans,et al.  Specifying Message Passing and Time-Critical Systems with Temporal Logic , 1992, Lecture Notes in Computer Science.

[17]  RR Rob Hoogerwoord.  The design of functional programs : a calculational approach , 1989 .

[18]  A. Mazurkiewicz.  Concurrent Program Schemes and their Interpretations , 1977 .

[19]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[20]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[21]  Wim H. Hesselink,et al.  Deadlock and Fairness in Morphisms of Transition Systems , 1988, Theor. Comput. Sci..

[22]  Ian J. Hayes,et al.  Specification case studies , 1987 .

[23]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[24]  C. Hemerik,et al.  An introduction to the category-theoretic solution of recursive domain equations , 1988 .

[25]  Kees M. van Hee,et al.  Executable Specifications for Distributed Information Systems , 1989, International Symposium on Combinatorial Optimization.