Abstract
Process fairness properties are semantically characterized in a non-interleaving model for concurrency, which allows a causality-based representation of finite and infinite concurrent behaviours. The model has been extended with additional structure so that process fairness can be defined. A variety of decompositions of the system into concurrent sub-processes, partially ordered by a refinement relation, have been derived. Each such decomposition gives rise to a class of process fairness properties. The hierarchies of process fairness properties are also discussed.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Bednarczyk, Categories of Asynchronous Systems, PhD Thesis, University of Sussex, 1987.
L. Boasson, M. Nivat, Adherences of Languages, Journal of Computer and System Sciences 20 (1980) 285–309.
G. Costa, C. Stirling, Weak and Strong Fairness in CCS, Information and Computation 73 (1987) 207–244.
N. Francez, Fairness (Springer-Verlag, New York, 1986).
G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D. Scott, A Compendium of Continuous Lattices (Springer-Verlag, 1980).
S. Katz and D. Peled, Defining Conditional Independence Using Collapses, in: M.Z. Kwiatkowska et al, eds., Semantics for Concurrency (Springer-Verlag, 1990) 262–280.
K. Kuratowski, Topology (Academic Press, 1966).
M.Z. Kwiatkowska, Event Fairness and Non-Interleaving Concurrency, Formal Aspects of Computing 1 3 (1989)
M.Z. Kwiatkowska, Fairness for Non-Interleaving Concurrency, PhD Thesis, University of Leicester, 1989. Also available as Technical Report 22, Department of Computing Studies, University of Leicester, 1989.
M.Z. Kwiatkowska, On Infinitary Trace Languages, Technical Report 31, Department of Computing Studies, University of Leicester, 1989.
M.Z. Kwiatkowska, Survey of Fairness Notions, Information and Software Technology 31 7 (1989).
M.Z. Kwiatkowska, On Topological Characterization of Behavioural Properties, to appear in: G.M. Reed and A.W. Roscoe, eds., Topology in Computer Science (Oxford University Press, 1990).
J.D. Lawson, The Versatile Continuous Order, in: M. Main et al, eds., Mathematical Foundations of Programming Language Semantics, 3rd Workshop, Lecture Notes in Computer Science 298 (Springer-Verlag, 1988).
D. Lehman, A. Pnueli, J. Stavi, Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, in: S.Even, O.Kariv, eds., Automata, Languages and Programming, Lecture Notes in Computer Science 115 (Springer-Verlag, 1981).
Z. Manna, A. Pnueli, The anchored version of the temporal framework, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg, eds., Linear Time, Branching time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354 (Springer-Verlag, 1989) 201–284.
A. Mazurkiewicz, Basic Notions of Trace Theory, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg, eds., Linear Time, Branching time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354 (Springer-Verlag, 1989) 285–263.
A. Mazurkiewicz, E. Ochmanski, W. Penczek, Concurrent Systems and Inevitability, Theoretical Computer Science 64 (1989) 281–304.
D. Park, Concurrency and Automata on Infinite Sequences, in: P. Deussen, ed., Proceedings of the 5th GI Conference on Theoretical Computer Science, Lecture Notes in Computer Science 104 (Springer-Verlag, 1981).
A. Pnueli, Applications of temporal logic to the specification and verification of reactive systems: a survey of current trends, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg, eds., Current Trends in Concurrency, Lecture Notes in Computer Science 224 (Springer-Vrlag, 1986).
W. Reisig, Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness, in: J. Paradaens, ed., Automata, Languages and Programming, Lecture Notes in Computer Science 172, Springer-Verlag (1984) 403–413.
M.W. Shields, Behavioural Presentations, in: in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg, eds., Linear Time, Branching time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354 (Springer-Verlag, 1989).
M.W. Shields, Elements of a Theory of Parallelism, to be published.
G. Winskel, Event Structures, Technical Report No.95, Computer Laboratory, Cambridge University, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kwiatkowska, M.Z. (1990). Defining process fairness for non-interleaving concurrency. In: Nori, K.V., Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1990. Lecture Notes in Computer Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53487-3_52
Download citation
DOI: https://doi.org/10.1007/3-540-53487-3_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53487-7
Online ISBN: 978-3-540-46313-9
eBook Packages: Springer Book Archive