Abstract
Causality-based partial order semantics allows an easy formulation of weak fairness. It is demonstrated that this is true also for other partial order semantics, namely for partial words and interval semiwords.
This work was partially supported by the DFG (Project ‘Halbordnungstesten’ and the ESPRIT Basic Research Working Group 6067 CALIBAN (CAusal calcuLI BAsed on Nets). A journal version of this paper will appear in Information Processing Letter.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Castellano, G. De Michelis, and L. Pomello. Concurrency vs. interleaving: An instructive example. Bull. EATCS, 31: 12–15, 1987.
P.C. Fishburn. Interval Orders and Interval Graphs. J. Wiley, 1985.
R.J. v. Glabbeek. The refinement theorem for ST-bisimulation semantics. In M. Broy and C.B. Jones, editors, Programming Con¬cepts and Methods, Proc. IFIP Working Conference, 27–52. Elsevier Science Publisher(North-Holland), 1990.
J. Grabowski. On partial languages. Fundamenta Informaticaey IV. 2: 428–498, 1981.
R. Janicki and M. Koutny. Representations of discrete interval orders and semi-orders. Technical Report 93-02, Dept. Comp. Sci. Sys., McMaster University, Hamilton, Ontario, 1993.
A. Kiehn. On the interrelationship between synchronized and non- synchronized behaviour of Petri nets. J. Inf. Process. Cybern. EIK, 24: 3–18, 1988.
W. Reisig. Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. In J. Paredaens, editor, Automata, Languages and Programming, Lect. Notes Comp. Sci. 172, 403–413. Springer, 1984.
P.H. Starke. Processes in Petri nets. J. Inf. Process. Cybern. EIK, 17: 389–416, 1981.
W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.
W. Vogler. The limit of splitn-language equivalence. Technical Report Nr. 288, Inst. f. Mathematik, Univ. Augsburg, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 British Computer Society
About this paper
Cite this paper
Vogler, W. (1995). Partial Order Semantics and Weak Fairness. In: Desel, J. (eds) Structures in Concurrency Theory. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3078-9_23
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3078-9_23
Publisher Name: Springer, London
Print ISBN: 978-3-540-19982-3
Online ISBN: 978-1-4471-3078-9
eBook Packages: Springer Book Archive