Net theory was initiated by C.A. Petri in the early 60s [29]. The subject matter of tne theory is distributed systems and processes. The key aspect of net theory is that the three fundamental relationships that can exist between the occurrences of a pair of actions at a state are clearly separated from each other at all levels of the theory. These three relationships are (i) at the state s, the action az can occur only after the action a, has occurred (causality); (ii) a, can occur or a2 can occur at s but not both (conflict, choice, indeterminacy); (iii) at the state s both a, and az can occur but with no order over their occurrences (concurrency). Another important feature of net theory is that states and changes-of-states (called transitions) are viewed as two intertwined but distinct entities; they are treated on an “equal” footing by the theory. Over the years net theory has evolved along many directions. It is difficult to give an overview of the whole theory in one place. Hence we shall attempt to do something more modest here. We shall first convey the basic concerns of net theory by presenting a simple system model called elementary net systems. Then we shall give a brief sketch of some of the tools that have been proposed to describe the behuuiour of elementary net systems. We shall concentrate on those tools that have either directly come out of net theory or which have been prodded into existence by the insistence of net theory that causality, conflict and concurrency should be clearly separated from each other in behavioural descriptions of distributed systems. In our presentation we will concentrate on motivations and basic definitions at the expense of stating theorems. The fe-v results that we present are stated without proofs. The proofs can be found in [26]. We shall however leave a trail of pointers to the literature, using which the interested reader can get a reasonable overview of net theory and related topics. In the next section the elementary net system model is presented. Using this model we then define the basic concepts of net theory. This sets the stage for developing the behavioural tools that can capture the essential features of distributed systems
[1]
Eike Best,et al.
A Theorem on the Characteristics of Non-sequential Processes
,
1977
.
[2]
A. Mazurkiewicz.
Concurrent Program Schemes and their Interpretations
,
1977
.
[3]
Ursula Goltz.
On Representing CCS Programs by Finite Petri Nets
,
1988,
MFCS.
[4]
Ernst-Rüdiger Olderog,et al.
Operational Petri net semantics for CCSP
,
1986,
European Workshop on Applications and Theory of Petri Nets.
[5]
Grzegorz Rozenberg,et al.
Theory of Traces
,
1988,
Theor. Comput. Sci..
[6]
Richard M. Karp,et al.
Parallel Program Schemata
,
1969,
J. Comput. Syst. Sci..
[7]
Kurt Lautenbach,et al.
System Modelling with High-Level Petri Nets
,
1981,
Theor. Comput. Sci..
[8]
Michel Hack,et al.
ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS
,
1972
.
[9]
P. S. Thiagarajan,et al.
A Fresh Look at Free Choice Nets
,
1984,
Inf. Control..
[10]
Peter H. Starke,et al.
Traces and semiwords
,
1984,
Symposium on Computation Theory.
[11]
P. S. Thiagarajan,et al.
D-Continuous Causal Nets: A Model of Non-Sequential Processes
,
1984,
Theor. Comput. Sci..
[12]
Grzegorz Rozenberg,et al.
Petri Nets: Basic Notions, Structure, Behaviour
,
1986,
Current Trends in Concurrency.
[13]
P. S. Thiagarajan,et al.
On the Equivalence of Asynchronous Control Structures
,
1973,
SIAM J. Comput..
[14]
Raymond R. Devillers,et al.
Sequential and Concurrent Behaviour in Petri Net Theory
,
1987,
Theor. Comput. Sci..
[15]
Antoni W. Mazurkiewicz.
Semantics of concurrent systems: a modular fixed-point trace approach
,
1984,
European Workshop on Applications and Theory in Petri Nets.
[16]
Marek Antoni Bednarczyk,et al.
Categories of asynchronous systems
,
1987
.