Skip to main content
SpringerLink
Log in

Ordinal processes in comparative concurrency semantics

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1991)

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

Included in the following conference series:

Abstract

When comparing concurrency semantics, one of the main difficulties is to find counter-examples to show that two equivalences do not coincide, which takes on considerable proportions if these equivalences coincide in the framework of finitely branching programs. The study of Ordinal Processes of Klop provides us with a wide family of simple counter-examples. The considered semantics are induced by temporal logics CTL, CTL * and L μ. We pursue this approach by, in addition, considering CCS-like contexts built up from the tyft operators of Groote and Vaandrager.

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. J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. On the consistency of Koomen's fair abstraction rule. Theoretical Computer Science, 51(1):129–176, 1987.

    Google Scholar 

  2. S. D. Brookes and W. C. Rounds. Behavioural equivalence relations induced by programming logics. In Proc. 10th ICALP, Barcelona, LNCS 154, pages 097–108. Springer-Verlag, July 1983.

    Google Scholar 

  3. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc. Logics of Programs Workshop, Yorktown Heights, LNCS 131, pages 52–71. Springer-Verlag, May 1981.

    Google Scholar 

  4. M. Dam. Translating CTL* into the modal μ-calculus. Research Report ECS-LFCS-90-123, Lab. for Foundations of Computer Science, Edinburgh, November 1990.

    Google Scholar 

  5. E. A. Emerson and E. M. Clarke. Characterizing correctness properties of parallel programs using fixpoints. In Proc. 7th ICALP, Noordwijkerhout, LNCS 85, pages 169–181. Springer-Verlag, July 1980.

    Google Scholar 

  6. E. A. Emerson and J. Y. Halpern. “Sometimes” and “Not Never” revisited: On branching versus linear time temporal logic. Journal of the ACM, 33(1):151–178, 1986.

    Google Scholar 

  7. J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Research Report CS-R8845, CWI, November 1988.

    Google Scholar 

  8. B. Herwig. Equivalence in PDL and Lμ. In Proc. 5th Easter Conf. Model Theory, Berlin, pages 46–56, April 1987.

    Google Scholar 

  9. B. Herwig. Zur Modelltheorie von Lμ. PhD thesis, Albert-Ludwigs Univ., Freiburg, September 1989.

    Google Scholar 

  10. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.

    Google Scholar 

  11. J. W. Klop. Bisimulation Semantics. Lectures given at the REX School/-Workshop, Noordwijkerhout, NL, May 1988.

    Google Scholar 

  12. D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science, 27(3):333–354, 1983.

    Google Scholar 

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

    Google Scholar 

  14. R. Milner. Functions as processes. Research Report 1154, INRIA, February 1990.

    Google Scholar 

  15. D. Park. Concurrency and automata on infinite sequences. In Proc. 5th GI Conf. on Th. Comp. Sci., LNCS 104, pages 167–183. Springer-Verlag, March 1981.

    Google Scholar 

  16. S. Pinchinat. Ordinal processes in comparative concurrency semantics. Research report, LIFIA-IMAG, Grenoble, 1991. To appear.

    Google Scholar 

  17. Ph. Schnoebelen. Congruence properties of the process equivalence induced by temporal logic. Research Report 831-I, LIFIA-IMAG, Grenoble, October 1990.

    Google Scholar 

  18. Ph. Schnoebelen. Sémantique du parallélisme et logique temporelle. Application au langage FP2. Thèse de Doctorat, I.N.P. de Grenoble, France, June 1990.

    Google Scholar 

  19. Ph. Schnoebelen and S. Pinchinat. On the weak adequacy of branchingtime temporal logic. In Proc. ESOP'90, Copenhagen, LNCS 432, pages 377–388. Springer-Verlag, May 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Imag - CNRS, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France

    S. Pinchinat

  2. LIFIA-IMAG, 46 Av. Félix Viallet, 38031, Grenoble Cedex, France

    S. Pinchinat

Authors
  1. S. Pinchinat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Gerhard Jäger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinchinat, S. (1992). Ordinal processes in comparative concurrency semantics. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023775

Download citation

  • DOI: https://doi.org/10.1007/BFb0023775

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55789-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation