Abstract
We propose, a translation method of finite terms of CCS into formulas of a modal language representing their class of observational congruence. For this purpose, we define a modal language and a function associating with any finite term of CCS a formula of the language, satisfied by the term. Furthermore, this function is such that two terms are congruent if and only if the corresponding formulas are equivalent. The translation method consists in associating with operations on terms (action,+) operations on the corresponding formulas.
This work is a first step towards the definition of a modal language with modalities expressing both possibility and inevitability and which is compatible with observational congruence.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Brookes S.D. and Rounds W.C. Behavioural equivalence relations induced by programming logics. Proceedings 10th ICALP, 83, LNCS Vol.154
Graf S. Logiques du temps arborescent pour la spécification et la preuve de programmes. Thèse 3ème Cycle, IMAG, Grenoble, February, 84
Graf S. and Sifakis J. A modal characterization of observational congruence on finite terms of CCS. R.R. no 402, IMAG, November 83
Hennessy M. and Milner R. On observing nondeterminism and concurrency. Proceedings 7th ICALP, 80. LNCS Vol. 85
Kozen D. Results on the propositional μ-calculus. Proceedings 9th ICALP, 82. LNCS Vol. 140
Milner R. A calculus of communicating systems. LNCS Vol. 92
Stirling C. A proof theoretic characterization of observational equivalence. University of Edinburgh, Internal Report CSR-132-83.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Graf, S., Sifakis, J. (1984). A modal characterization of observational congruence on finite terms of CCS. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive