Advertisement

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.

Keywords

Concurrency Processes partial order synchronization fairness refinement. 

References

  1. Abadi, M., Lamport, L. (1989) Composing Specifications. Lecture Notes in Computer Science, 430, 1–41MathSciNetCrossRefGoogle Scholar
  2. Diekert, V., Rozenberg, G. (eds.) (1994) The book of traces. World Scientific, Singapore,New Jersey,London,I-long Kong.Google Scholar
  3. Mazurkiewicz, A. (1977) Concurrent Program Schemes and Their Interpretation. Technical Report DAIMI PB-78, Århns UniversityGoogle Scholar
  4. Mazurkiewicz, A. (1985) Semantics of Concurrent Systems: A Modular Fixed-Point Trace Approach. Lecture Notes in Computer Science, 188.Google Scholar
  5. Mazurkiewicz, A., Ochmanski, E.,Penczek, W. (1989) Concurrent systems and inevitability. Theoretical Computer Science, 64, 281–304.MathSciNetCrossRefzbMATHGoogle Scholar
  6. Owicki, S., Lamport, L. (1982)Proving liveness properties of concurrent programs. ACM Trans. Programming, Languages, and Systems 4(3), 455–495.CrossRefGoogle Scholar
  7. Petri, C.A. (1977) Non-Sequential Processes. GMD Report ISF-77–05.Google Scholar
  8. Pratt, V. (1986) Modeling Concurrency with Partial Orders. International Journal of Parallel Processing, 15, 33–71.MathSciNetCrossRefzbMATHGoogle Scholar
  9. Reisig, W. (1985) Petri Nets: an Introduction EATCS Monographs on Comp.Sci.CrossRefzbMATHGoogle Scholar
  10. Rozenberg, G. (1987) Behaviour of Elementary Net Systems. Lecture Notes in Computer Science, 254, 26–59CrossRefGoogle Scholar
  11. Shields, M.W. (1979) Non-sequential behaviour, part I. Int. Report CSR-120–82, Dept. of Computer Science, University of Edinburgh.Google Scholar
  12. Thiagarajan, P.S. (1987) Elementary Net Systems. Lecture Notes in Computer Science, 254, 26–59.MathSciNetCrossRefGoogle Scholar
  13. Winskel, G. (1988) An introduction to event structures. Lecture Notes in Computer Science, 354, 123–172Google Scholar

Copyright information

© IFIP International Federation for Information Processing 1996

Authors and Affiliations

  • A. Mazurkiewicz
    • 1
  1. 1.Institute of Computer Science of PASWarsawPoland

Personalised recommendations