Skip to main content

The consistency of a noninterleaving and an interleaving model for full TCSP

  • Commanications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1991)

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

Included in the following conference series:

  • 129 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.W. de Bakker, J.I. Zucker: Processes and the Denotational Semantics of Concurrency, Information and Control, Vol.54, No 1/2, pp 70–120, 1982.

    Google Scholar 

  2. J.A. Bergstra, J.W. Klop: Process Algebra for Synchronous Communication, Information and Control, Vol 60, No 1–3, pp 109–137, 1984.

    Google Scholar 

  3. G. Boudol, I. Castellani: On the Semantics of Concurrency: Partial Orders and Transition Systems, Proc. TAPSOFT 87, Vol 1, Lecture Notes in Computer Science 249, Springer-Verlag, pp 123–137, 1987.

    Google Scholar 

  4. G. Boudol, I. Castellani: Permutation of transitions: An event structure semantics for CCS and SCCS, Proc. School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Lecture Notes in Computer Science 354, Springer-Verlag, pp 411–427, 1989.

    Google Scholar 

  5. S.D. Brookes: A Model for Communicating Sequential Processes, Report CMU-CS 83–149, Carnegie-Mellon University, January 1983.

    Google Scholar 

  6. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe: A Theory of Communicating Sequential Processes, Journal of the ACM, Vol. 31, No. 3, July 1984.

    Google Scholar 

  7. S.D. Brookes, A.W. Roscoe: An Improved Failures Model for Communicating Processes, Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag, 1985.

    Google Scholar 

  8. P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Acta Informatica 26, pp 59–91, 1988.

    Google Scholar 

  9. P.Degano, R. De Nicola, U. Montanari: On the Consistency of ‘Truly Concurrent’ Operational and Denotational Semantics, Proc. Symposium on Logic in Computer Science, Edinburgh, pp 133–141, 1988.

    Google Scholar 

  10. U. Goltz: On Representing CCS Programs as Finite Petri Nets, Proc. MFCS 88, Lecture Notes in Computer Science 324, Springer-Verlag, pp 339–350, 1988.

    Google Scholar 

  11. U. Goltz, R. Loogan: Modelling Nondeterministic Concurrent Processes with Event Structures, Fundamenta Informaticae, Vol.14, No.1, pp 39–73, 1991.

    Google Scholar 

  12. U. Goltz, A. Mycroft: On the Relationship of CCS and Petri Nets, Proc. ICALP 84, Lecture Notes in Computer Science 172, Springer-Verlag, 1984.

    Google Scholar 

  13. C.A.R. Hoare: Communicating Sequential Processes, Prentice Hall, 1985.

    Google Scholar 

  14. R. Milner: A Calculus of Communicating Systems, Lecture Notes in Computer Science 92, Springer-Verlag, 1980.

    Google Scholar 

  15. R. Milner: Lectures on a Calculus of Communicating Systems, Seminar on Concurrency, Lecture Notes in Computer Science 197, Springer-Verlag, 1985.

    Google Scholar 

  16. M. Nielsen, G. Plotkin, G. Winskel: Petri-Nets, Event Structures and Domains, Theoretical Computer Science, Vol. 13, No. 1, pp 85–108, 1981.

    Google Scholar 

  17. E.R. Olderog: TCSP: Theory of Communicating Sequential Processes, Advances in Petri-Nets 1986, Lecture Notes in Computer Science 255, Springer-Verlag, pp 441–465, 1987.

    Google Scholar 

  18. E.R. Olderog: Operational Petri-Net Semantics for CCSP, Advances in Petri-Nets 1987, Lecture Notes in Computer Science 266, Springer-Verlag, pp 196–223, 1987.

    Google Scholar 

  19. G.D. Plotkin: An Operational Semantics for CSP, Formal Description of Programming Concepts II, Ed.: D. Bjorner, North Holland, pp 199–225, 1983.

    Google Scholar 

  20. W. Reisig: Partial Order Semantics versus Interleaving Semantics for CSP-like languages and its Impact on Fairness, Proc. ICALP 84, Lecture Notes in Computer Science 172, Springer-Verlag, pp 403–413, 1984.

    Google Scholar 

  21. D. Taubner, W. Vogler: The Step Failure Semantics, Proc. STACS 87, Lecture Notes in Computer Science 247, Springer-Verlag, pp 348–359, 1987.

    Google Scholar 

  22. G. Winskel: Events in Computation, Ph.D. Thesis, University of Edinburgh, Report CST-10-80, December 1980.

    Google Scholar 

  23. G. Winskel: Event Structure Semantics for CCS and Related Languages, Proc. ICALP 82, Lecture Notes in Computer Science 140, Springer-Verlag, pp 561–576, 1982.

    Google Scholar 

  24. G. Winskel: Synchronisation trees, Theoretical Computer Science, May 1985.

    Google Scholar 

  25. G. Winskel: Event Structures, Petri-Nets: Applications and Relationships to Other Models of Concurrency, Lecture Notes in Computer Science 255, Springer-Verlag, pp 325–392, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

L. Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baier, C., Majster-Cederbaum, M.E. (1991). The consistency of a noninterleaving and an interleaving model for full TCSP . In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54458-5_55

Download citation

  • DOI: https://doi.org/10.1007/3-540-54458-5_55

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54458-6

  • Online ISBN: 978-3-540-38391-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics