A modal characterization of observational congruence on finite terms of CCS
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.
KeywordsModal Language Congruence Class Label Tree Verification Tool Translation Method
Unable to display preview. Download preview PDF.
- [BR]Brookes S.D. and Rounds W.C. Behavioural equivalence relations induced by programming logics. Proceedings 10th ICALP, 83, LNCS Vol.154Google Scholar
- [Gr]Graf S. Logiques du temps arborescent pour la spécification et la preuve de programmes. Thèse 3ème Cycle, IMAG, Grenoble, February, 84Google Scholar
- [GS]Graf S. and Sifakis J. A modal characterization of observational congruence on finite terms of CCS. R.R. no 402, IMAG, November 83Google Scholar
- [HM]Hennessy M. and Milner R. On observing nondeterminism and concurrency. Proceedings 7th ICALP, 80. LNCS Vol. 85Google Scholar
- [Ko]Kozen D. Results on the propositional μ-calculus. Proceedings 9th ICALP, 82. LNCS Vol. 140Google Scholar
- [Mi]Milner R. A calculus of communicating systems. LNCS Vol. 92Google Scholar
- [St]Stirling C. A proof theoretic characterization of observational equivalence. University of Edinburgh, Internal Report CSR-132-83.Google Scholar