Abstract
Some theoretical issues related to concurrent processed are discussed: formal description of concurrent systems, concurrent systems synchronization, refinement of systems, fairness assumption. These issues are considered on possibly high level of abstraction enabling their proper identification, formulation, and formalization. So-called prefix functions serve as a model of concurrent processes. The notion of prefix functions is a unifying concept for description purposes of a number of existing representations of concurrent processes based on finite set of atomic actions.
Partially supported by grant 8 T11C 029 08 of KBN (Scientific Research Counsil of Poland)
Chapter PDF
References
Abadi, M., Lamport, L. (1989) Composing Specifications. Lecture Notes in Computer Science, 430, 1–41
Diekert, V., Rozenberg, G. (eds.) (1994) The book of traces. World Scientific, Singapore,New Jersey,London,I-long Kong.
Mazurkiewicz, A. (1977) Concurrent Program Schemes and Their Interpretation. Technical Report DAIMI PB-78, Århns University
Mazurkiewicz, A. (1985) Semantics of Concurrent Systems: A Modular Fixed-Point Trace Approach. Lecture Notes in Computer Science, 188.
Mazurkiewicz, A., Ochmanski, E.,Penczek, W. (1989) Concurrent systems and inevitability. Theoretical Computer Science, 64, 281–304.
Owicki, S., Lamport, L. (1982)Proving liveness properties of concurrent programs. ACM Trans. Programming, Languages, and Systems 4(3), 455–495.
Petri, C.A. (1977) Non-Sequential Processes. GMD Report ISF-77–05.
Pratt, V. (1986) Modeling Concurrency with Partial Orders. International Journal of Parallel Processing, 15, 33–71.
Reisig, W. (1985) Petri Nets: an Introduction EATCS Monographs on Comp.Sci.
Rozenberg, G. (1987) Behaviour of Elementary Net Systems. Lecture Notes in Computer Science, 254, 26–59
Shields, M.W. (1979) Non-sequential behaviour, part I. Int. Report CSR-120–82, Dept. of Computer Science, University of Edinburgh.
Thiagarajan, P.S. (1987) Elementary Net Systems. Lecture Notes in Computer Science, 254, 26–59.
Winskel, G. (1988) An introduction to event structures. Lecture Notes in Computer Science, 354, 123–172
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Mazurkiewicz, A. (1996). True versus artificial concurrency. In: Dembiński, P., Średniawa, M. (eds) Protocol Specification, Testing and Verification XV. PSTV 1995. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34892-6_4
Download citation
DOI: https://doi.org/10.1007/978-0-387-34892-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2925-1
Online ISBN: 978-0-387-34892-6
eBook Packages: Springer Book Archive