Petri Net systems and their closure properties

We introduce Petri net systems as a means for a hierachical development of concurrent systems. A Petri net system is a finite family of place/transition nets which may call each other in a certain way. We study the generating power of these systems and prove closure properties of the class of languages accepted by them.

[1]  Raymond R. Devillers,et al.  Sequential and Concurrent Behaviour in Petri Net Theory , 1987, Theor. Comput. Sci..

[2]  Ichiro Suzuki,et al.  Stepwise Refinements of Transitions and Places , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[3]  Giorgio De Michelis,et al.  Concurrency versus interleaving: an instructuve example , 1987, Bull. EATCS.

[4]  Bernd Baumgarten,et al.  On Internal and External Characterizations of PT- net Building Block Behaviors , 1988, European Workshop on Applications and Theory of Petri Nets.

[5]  J. Grabowski,et al.  On partial languages , 1981, Fundam. Informaticae.

[6]  Wolfgang Reisig,et al.  Recursive Nets , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[7]  Charles André.  Behaviour of a Place - Transition Net on a Subset of Transitions , 1981, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[8]  Matthias Jantzen.  Language theory of Petri nets , 1986 .

[9]  Walter Vogler,et al.  Behaviour Preserving Refinement of Petri Nets , 1986, WG.

[10]  Vadim E. Kotov,et al.  An Algebra for Parallelism Based on Petri Nets , 1978, MFCS.

[11]  Grzegorz Rozenberg,et al.  Concurrency and Nets , 1987, Springer Berlin Heidelberg.

[12]  Wolfgang Reisig,et al.  The Non-sequential Behavior of Petri Nets , 1983, Inf. Control..

[13]  K. Voss,et al.  Interface as a basic concept for systems specification and verification , 1987 .

[14]  Jay Loren Gischer,et al.  Partial orders and the axiomatic theory of shuffle (pomsets) , 1985 .

[15]  Ludmila Cherkasova,et al.  Structured Nets , 1981, International Symposium on Mathematical Foundations of Computer Science.

[16]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[17]  Robert Valette,et al.  Analysis of Petri Nets by Stepwise Refinements , 1979, J. Comput. Syst. Sci..

[18]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[19]  Wolfgang Reisig,et al.  Petri Nets: Central Models and Their Properties , 1986, Lecture Notes in Computer Science.

[20]  Vaughan R. Pratt,et al.  On the composition of processes , 1982, POPL '82.

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

[22]  Klaus Müller.  Constructable Petri Nets , 1985, J. Inf. Process. Cybern..

[23]  Astrid Kiehn.  On the Interrelation Between Synchronized and Non-Synchronized Behaviour of Petri Nets , 1988, J. Inf. Process. Cybern..