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.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
M. Dam. Translating CTL* into the modal μ-calculus. Research Report ECS-LFCS-90-123, Lab. for Foundations of Computer Science, Edinburgh, November 1990.
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.
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.
J. F. Groote and F. W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Research Report CS-R8845, CWI, November 1988.
B. Herwig. Equivalence in PDL and Lμ. In Proc. 5th Easter Conf. Model Theory, Berlin, pages 46–56, April 1987.
B. Herwig. Zur Modelltheorie von Lμ. PhD thesis, Albert-Ludwigs Univ., Freiburg, September 1989.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137–161, January 1985.
J. W. Klop. Bisimulation Semantics. Lectures given at the REX School/-Workshop, Noordwijkerhout, NL, May 1988.
D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science, 27(3):333–354, 1983.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.
R. Milner. Functions as processes. Research Report 1154, INRIA, February 1990.
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.
S. Pinchinat. Ordinal processes in comparative concurrency semantics. Research report, LIFIA-IMAG, Grenoble, 1991. To appear.
Ph. Schnoebelen. Congruence properties of the process equivalence induced by temporal logic. Research Report 831-I, LIFIA-IMAG, Grenoble, October 1990.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights 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