Inevitability in concurrent systems. (English) Zbl 0653.68011

Summary: This paper deals with the concurrent systems viewed as partially ordered sets. A set of system states is called inevitable if each execution of the system sooner or later meets this set. A formal definition of inevitability in arbitrary concurrent systems is proposed. Some properties of inevitable sets are proved.


68Q65 Abstract data types; algebraic specification
06A06 Partial orders, general
68N25 Theory of operating systems
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Full Text: DOI


[1] Best, E.; Fernandez, C.; Plunnecke, H., Concurrent Systems and Processes, GMD-Studien Nr. 104 (1985)
[2] Mazurkiewicz, A., Complete Processes and Inevitability, (Rept. No. 86-06 (1986), Univ. of Leiden: Univ. of Leiden The Netherlands)
[3] Petri, C. A., Non-Sequential Processes, GMD-ISF Rept. 77-05 (1977)
[4] Reisig, W., Petri Nets (1985), Springer: Springer Berlin · Zbl 0521.68057
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.