Some Aspects of Net Theory

A marking of a net is a d i s t r i b u t i o n of objects cal led tokens over the S-elements of the net. In th is sense, a state of the system is a d i s t r i buted en t i t y . Wherein the tokens do not have any in terna l s t ructure and hence can not be d is t inguished from each other, the resu l t i ng marked nets are ofen cal led Petr i nets. As the name suggests, Petr i nets were f i r s t proposed by C.A. Petr i as a model of concurrent systems in his d isser ta t ion ~ 7 ] . In general though the tokens can have in terna l s t ruc ture . This leads to a va r ie ty of powerful system models based on nets [ i 0 , 19, 35].

[1]  Hartmann J. Genrich,et al.  The Calculus of Facts , 1976, MFCS.

[2]  C. A. Petri.  Concepts of Net Theory , 1973, MFCS.

[3]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[4]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[5]  Eike Best,et al.  Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets , 1983, CAAP.

[6]  Raymond M. Smullyan.  First-Order Logic. Preliminaries , 1968 .

[7]  Kurt Lautenbach,et al.  The Orderly Resolution of Memory Access Conflicts Among Competing Channel Processes , 1982, IEEE Transactions on Computers.

[8]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[9]  Wolfgang Reisig,et al.  Petri Nets with Individual Tokens , 1982, Theor. Comput. Sci..

[10]  Kurt Lautenbach,et al.  System Modelling with High-Level Petri Nets , 1981, Theor. Comput. Sci..

[11]  Glynn Winskel,et al.  Event Structure Semantics for CCS and Related Languages , 1982, ICALP.

[12]  Kurt Jensen,et al.  Coloured Petri Nets and the Invariant-Method , 1981, Theor. Comput. Sci..

[13]  Eike Best,et al.  The Relative Strength of K-Density , 1979, Advanced Course: Net Theory and Applications.

[14]  Klaus Voss.  Using Predicate/Transition-Nets to Model and Analyze Distributed Database Systems , 1980, IEEE Trans. Software Eng..

[15]  Kurt Lautenbach,et al.  Elements of General Net Theory , 1979, Advanced Course: Net Theory and Applications.

[16]  Michel Hack,et al.  Decidability Questions for Petri Nets , 1975, Outstanding Dissertations in the Computer Sciences.

[17]  Glynn Winskel,et al.  Events in computation , 1980 .

[18]  Rüdiger Valk,et al.  Formal Properties of Place/Transition Nets , 1979, Advanced Course: Net Theory and Applications.

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

[20]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[21]  C. A. Petri.  State-transition structures in physics and in computation , 1982 .

[22]  P. S. Thiagarajan,et al.  D-Continuous Causal Nets: A Model of Non-Sequential Processes , 1984, Theor. Comput. Sci..

[23]  Kurt Lautenbach,et al.  Substitution Systems - A Family of System Models Based on Concurrency , 1980, MFCS.

[24]  P. S. Thiagarajan,et al.  On the Equivalence of Asynchronous Control Structures , 1973, SIAM J. Comput..

[25]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[26]  P. S. Thiagarajan,et al.  Well-Formed Flow Charts for Concurrent Programming , 1982, Formal Description of Programming Concepts.

[27]  Eike Best,et al.  Discreteness, k-density and d-continuity of occurrence nets , 1983, Theoretical Computer Science.

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

[29]  P. S. Thiagarajan,et al.  A Fresh Look at Free Choice Nets , 1984, Inf. Control..

[30]  Glynn Winskel,et al.  A New Definition of Morphism on Petri Nets , 1984, STACS.

[31]  C. Petri.  Kommunikation mit Automaten , 1962 .