Abstract
This paper reports on a work that proposes a kernel for an execution environment for the operational semantics and the behavioural equivalences of CCS. The proposed execution environment distinguishes itself by being formal, by dealing with the behavioural equivalences as schemes of axioms, differently from other approaches based on automata, and by giving the possibility to define several strategies of verification in a modular and flexible way. The environment, obtained by techniques of logic-functional programming, treats basic CCS with bounded recursion. A particular strategy of verification is presented.
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
Bosco, P.G., Giovannetti, E., Moiso, C. Refined Strategies for Semantic Unification, Proc. TAPSOFT '87, LNCS 250, Vol.2, Springer-Verlag, (1987), pp.276–290.
Bolognesi, T., Smolka, S. A. Fundamental Results for the Verification of Observational Equivalence: A Survey, Proc. IFIP TC6/WG 6.1, Zurich, North Holland, (May 1987).
De Nicola, R. Testing Equivalences and Fully Abstract Models for Communicating Processes, Ph.D. Thesis, University of Edinburgh, Internal Report CST-36-85, (1985).
Fantechi, A., Gnesi, S., Inverardi, P., Montanari, U. An execution environment for the formal definition of Ada, Proc. ESEC '87, LNCS 289, (September 1987), pp.327–335.
Gnesi, S., Inverardi, P., Nesi, M. “A logic-functional approach to the execution of CCS specifications modulo behavioural equivalences”, Internal Report IEI no B4-08, (1988).
Hennessy, M., Milner, R. Algebraic Laws for Nondeterminism and Concurrency, Journal of ACM, Vol.32, No.1, (1985), pp.137–161.
Huet, G., Oppen, D.C. Equations and Rewrite Rules: A Survey, In “Formal Language Theory: Perspectives and Open Problems”, Book R.V. (ed.), Academic Press, New York, (1980), pp.349–405.
Hullot, J.M. Canonical Forms and Unification, Proc. 5th CADE, LNCS 87, Springer-Verlag, (1980), pp.318–334.
Hussman, H. Unification in Conditional-Equational Theories, Proc. EUROCAL '85, LNCS 204, Vol.2, Springer-Verlag, (1985), pp.543-553.
Kanellakis, P.C., Smolka, S.A. CCS Expressions, Finite State Processes and Three Problems of Equivalence, Dept. of Computer Science, Brown University, Providence, (February 1983).
Lloyd, J.W. Foundations of Logic Programming, Springer-Verlag, (1984).
Milner, R. A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, (1980).
Milner, R. Calculus for Communicating Systems, LNCS 197, Springer-Verlag, (1984), pp.197–220.
Milner, R. A Complete Axiomatisation for Observational Congruence of Finite-State Behaviours, ECS-LFCS-86-8, (August 1986).
Nesi, M. Un approccio logico-funzionale all'esecuzione di linguaggi di specifica concorrenti (CCS) modulo equivalenze comportamentali, Tesi di Laurea, University of Pisa, (1988).
Parrow, J. Concurrency Workbench Prototype: Operating Instructions, Internal Report, University of Edinburgh, (November 1986).
Sterling, L. Expert System = Knowledge + Meta-Interpreter, Dept. of Applied Mathematics, The Weizmann Institute of Science, Internal Report CS-84-17, (1985).
Vergamini, D. Verification by means of observational equivalence on automata, Rapports de Recherche, INRIA no 501, (1986).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gnesi, S., Inverardi, P., Nesi, M. (1988). A logic-functional approach to the execution of CCS specifications modulo behavioural equivalences. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_40
Download citation
DOI: https://doi.org/10.1007/3-540-50403-6_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50403-0
Online ISBN: 978-3-540-45999-6
eBook Packages: Springer Book Archive