Skip to main content
SpringerLink
Log in

Invariants and paradigms of concurrency theory

  • Submitted Presentations
  • Conference paper
  • First Online:
PARLE '91 Parallel Architectures and Languages Europe (PARLE 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 506))

Abstract

We introduce a new invariant semantics of concurrent systems which is a direct generalisation of the causal partial order semantics. Our new semantics overcomes some of the problems encountered when one uses causal partial orders alone. We discuss various aspects of the new invariant model. In particular, we outline how the new invariants can be generated by 1-safe inhibitor Petri nets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allen J.F., Kentz H.A., A Model of Naive Temporal Reasoning, In: J.R. Mobbs, R.C. Moore (Eds.), Formal Theories of the Commonsense World, Ablex 1985.

    Google Scholar 

  2. Best E., Devillers R., Concurrent Behaviour: Sequences, Processes and Programming Languages, GMD-Studien Nr. 99, GMD, Bonn, 1985.

    Google Scholar 

  3. Best E., Devillers R., Sequential and Concurrent Behaviour in Petri Net Theory, Theoretical Computer Science, 55 (1987), pp. 87–136.

    Google Scholar 

  4. Best E., Koutny M., Petri Net Semantics of Priority Systems, to appear in Theoretical Computer Science.

    Google Scholar 

  5. Fishburn P.C., Intransitive Indifference with Unequal Indifference Intervals, J. Math. Psych. 7, 1970, pp. 144–19.

    Google Scholar 

  6. Fishburn P.C., Interval Orders and Interval Graphs, J. Wiley, 1985.

    Google Scholar 

  7. Fräise R., Theory of Relations, North Holland 1986.

    Google Scholar 

  8. Hoare C.A.R., Communicating Sequential Processes, Prentice-Hall, 1985.

    Google Scholar 

  9. Janicki R., A Formal Semantics for Concurrent Systems with a Priority Relation, Acta Informatica 24, 1987, pp.33–55.

    Google Scholar 

  10. Janicki R., Koutny M., Observing Concurrent Histories, in: Real-Time Systems, Theory and Applications, H.M.S. Zedan (Ed.), Elsevier Science Publishers B.V. (North-Holland), 1990, pp 133–142.

    Google Scholar 

  11. Janicki R., Koutny M., A Bottom-Top Approach to Concurrency Theory Part I: Observations, Invariants and Paradigms, Technical Report No. 90-04, Dept. of Comp. Sci. and Syst., McMaster University, 1990.

    Google Scholar 

  12. Janicki R., Lauer P.E., On the Semantics of Priority Systems, 17th Annual International Conference on Parallel Processing, Vol. 2, pp. 150–156, 1988, Pen. State Press.

    Google Scholar 

  13. Katz S., Peled D., Interleaving Set Temporal Logic, 6th ACM Symposium on Principles of Distributed Computing, Vancouver 1984, pp. 178–190.

    Google Scholar 

  14. Lamport L., What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority, 12th ACM Symposium on Principles of Programming Languages, New Orleans, Louisiana, 1985, pp. 78–83.

    Google Scholar 

  15. Lamport L., On Interprocess Communication, Part I: Basic formalism, Part II: Algorithms, Distributed Computing 1(1986), pp. 77–101.

    Google Scholar 

  16. Lengauer C., Hehner E.C.R., A Methodology for Programming with Concurrency: An Informal Presentation, Science of Computer Programming 2 (1982), pp. 1–18.

    Google Scholar 

  17. Mazurkiewicz A., Trace Theory, Lecture Notes in Computer Science 225, Springer 1986, pp. 297–324.

    Google Scholar 

  18. Milner R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.

    Google Scholar 

  19. Monk J.D., Mathematical Logic, Springer 1976.

    Google Scholar 

  20. Peterson J.L., Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981.

    Google Scholar 

  21. Pratt V., Modelling Concurrency with Partial Orders, Int. Journal of Parallel Programming 15, 1 (1986), pp. 33–71.

    Google Scholar 

  22. Reisig W., Petri Nets, Springer 1985.

    Google Scholar 

  23. Szpilrajn-Marczewski E., Sur l'extension de l'ordre partial, Fundamenta Mathematicae 16 (1930), pp. 386–389.

    Google Scholar 

  24. Wiener N., A Contribution to the Theory of Relative Position, Proc. Camb. Philos. Soc. 17 (1914), pp. 441–449.

    Google Scholar 

  25. Winskel G., Event Structure Semantics for CCS and Related Language, Lecture Notes in Computer Science 140, Springer 1982, pp. 561–567.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Systems, McMaster University, L8S 4K1, Hamilton, Ontario, Canada

    Ryszard Janicki

  2. Computing Laboratory, The University of Newcastle upon Tyne, NE1 7RU, Newcastle upon Tyne, U.K.

    Maciej Koutny

Authors
  1. Ryszard Janicki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maciej Koutny
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Emile H. L. Aarts Jan van Leeuwen Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag

About this paper

Cite this paper

Janicki, R., Koutny, M. (1991). Invariants and paradigms of concurrency theory. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) PARLE '91 Parallel Architectures and Languages Europe. PARLE 1991. Lecture Notes in Computer Science, vol 506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54152-7_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-54152-7_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54152-3

  • Online ISBN: 978-3-540-47472-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation