Summary
This work has been motivated by the following general problem: find logics for the specification and proof of programs, described by terms of some algebra with given congruence relation. This relation is supposed to define a satisfactory concept for the behavioural comparison of programs. We require these logics to be adequate with respect to the term language, in the sense that two programs, behaviourally equivalent satisfy the same formulas and conversely. The term language considered is the subset of controllable, regular terms of CCS, on a vocabulary of actions A, with observational congruence. A term is said to be controllable if it is congruent to some term without occurrence of τ. We obtain an adequate logic whose language of formulas is obtained from constants true, false and ¦Nil¦ by using operators ∨, ∧, fixpoint operators, + and a for a∈A; the latter can be considered as extensions of the operators + and a for a∈A of CCS. As a result, controllable CCS terms can be considered as formulas of this logic and the problem of program verification is reduced to the proof of the validity of a formula.
Similar content being viewed by others
References
Bergstra, J.A., Klop, J.W.: Algebra of Communicating Processes. Centrum of Wiskunde en Informatica. Internal report CS-R8421
Brookes, S., Hoare, T., Roscoe, A.W.: A Theory of Communicating Sequential Processes. J. Assoc. Comput. Machinery 31, 560–599 (1984)
Brookes, S.D., Rounds, W.C.: Behavioural equivalence relations induced by programming logics. Proceedings 10th ICALP 83, LNCS 154
Graf, S.: Logiques du temps arborescent pour la spécification et la preuve de programmes. Thèse 3ème cycle, IMAG, Grenoble, February 1984
Graf, S., Sifakis, J.: A modal characterization of finite terms of CCS, pp. 222–234, ICALP 84, LNCS 172
Graf, S., Sifakis, J.: A Logic for the Description of Non-deterministic Programs and their Properties. Report IMAG RR511, Grenoble, February 1985
Hennessy, M., Milner, R.: Algebraic Laws for Nondeterminism and Concurrency. J. Assoc. Comput. Machinery 32, 137–161 (1985)
Kozen, D.: Results on the Propositional μ-Calculus. ICALP 82, LNCS 140, pp. 348–359
Milner, R.: A Calculus for Communicating Systems, LNCS 92
Stirling, C.: A Proof Theoretic Characterization of Observational Equivalence. FCT-TCS Bangalore 1983
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Graf, S., Sifakis, J. A logic for the specification and proof of regular controllable processes of CCS. Acta Informatica 23, 507–527 (1986). https://doi.org/10.1007/BF00288467
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00288467