The aim of this paper is to propose a mathematical tool, as well general as precise, for reasoning about concurrent systems. Ordered semi-commutative monoids are chosen for this purpose; their directed subsets represent processes of concurrent systems. Properties of such processes are proved; the main one is the diamond property. Infinite semitraces and their graphs are defined. Special sequences of actions, called linearizations and fair linearizations, are distinguished in order to represent finite and infinite processes. Finally, the approach is applied for modelling behaviours of general Petri-nets. Some kind of fairness, oriented on tokens, is introduced. It is shown that complete processes of general petri-nets, contrary to those of elementary nets, are not always fair.
[1]
Hans-Jörg Stoß.
On the Representation of Rational Functions of Bounded Complexity
,
1989,
Theor. Comput. Sci..
[2]
Edward Ochmanski,et al.
Semi-Commutation and Deterministic Petri Nets
,
1990,
MFCS.
[3]
Edward Ochmanski.
Semi-commutation for P-T Systems
,
1989,
Bull. EATCS.
[4]
M. Clerbout,et al.
Semi-commutations
,
1987,
Inf. Comput..
[5]
Wojciech Penczek,et al.
Concurrent Systems and Inevitability
,
1989,
Theor. Comput. Sci..
[6]
Elöd Knuth,et al.
Semi-Commutations and Petri Nets
,
1989,
Theor. Comput. Sci..