Abstract
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.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
A more complete version of this paper, with full proofs, broader comments and additional examples, is available as Report 714/1991 of LRI of University Paris-Sud.
Preview
Unable to display preview. Download preview PDF.
References
M.Clerbout/M.Latteux: Semi-Commutations; Information and Computation 73, 1987.
D.V.Hung/E.Knuth: Semi-Commutations and Petri Nets; Theoretical Computer Science 64.1, 1989.
A.Mazurkiewicz: Complete Processes and Inevitability; Report 86-06, University of Leiden 1986.
A.Mazurkiewicz: Trace Theory; Advanced Course on Petri Nets 86, LNCS 255, 1987.
A.Mazurkiewicz/E.Ochmański/W.Penczek: Concurrent Systems and Inevitability; Theoretical Computer Science 64.3, 1989.
E.Ochmański: Semi-Commutation for Place/Transition Systems; EATCS Bulletin 38, June 1989.
E.Ochmański: Semi-Commutation and Deterministic Petri Nets; Proceedings of MFCS'90, LNCS 452, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ochmański, E. (1992). Modelling concurrency with semi-commutations. In: Havel, I.M., Koubek, V. (eds) Mathematical Foundations of Computer Science 1992. MFCS 1992. Lecture Notes in Computer Science, vol 629. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-55808-X_40
Download citation
DOI: https://doi.org/10.1007/3-540-55808-X_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55808-8
Online ISBN: 978-3-540-47291-9
eBook Packages: Springer Book Archive