Abstract
In this paper we describe CCS models in terms of categories of structured transition systems: we define two categories CCS and CMonRCCS for representing interleaving and “truly concurrent”, distributed aspects of CCS (without recursion). Among the objects of CCS and CMonRCCS we choose two standard models, called M and M respectively. We show that our interleaving model M essentially coincides with the classical transition system of CCS, while the distributed model M faithfully expresses the issues about decentralized control and multiple representations of agents discussed in a recent paper by the first author in collaboration with P. Degano and R. De Nicola [4]. Consistency of distributed and interleaving semantics is also proved.
The advantage of defining categories of models instead of simply models is that within the same category we can distinguish initial transition systems, whose transitions are proofs, and interpreted transition systems, which embody synchronization algebras. Another advantage of categories is the use of free adjoints of forgetful functors for constructing the models and for comparing transition systems having similar, but different, structures.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research performed in part while visiting ESLAI with the support of the Italian Foreign Ministry, Programma di Cooperazione e Sviluppo.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Badouel, E., Une Construction Systématique de Modèles à Partir de Spécifications Opérationnelles Structurelles, Report n o 764, INRIA, 1988.
Boudol, G. and Castellani, I., Permutation of Transitions: an Event Structure Semantics for CCS and SCCS, in: J. W. de Bakker, W. T. de Roever and G. Rozenberg (Eds.), Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Springer LNCS 354, pp. 411–427, 1988.
Degano, P., De Nicola, R. and Montanari, U., Partial Ordering Derivations for CCS, Proc. 5th Int. Conf. on Fundamentals of Computation Theory (L. Budach, ed.), LNCS 199, pp. 520–523, Springer-Verlag, 1985.
Degano, P., De Nicola, R. and Montanari, U., A Distributed Operational Semantics for CCS Based on Condition/Event Systems, Acta Informatica 26, pp. 59–91 (1988).
Degano, P., Meseguer, J., Montanari, U., Axiomatizing Net Computations and Processes, Proc. 4th Symp. on Logics in Computer Science, IEEE 1989.
Degano, P., De Nicola, R., Montanari, U., On the Consistency of “Truly Concurrent” Operational and Denotational Semantics, Proc. 3rd Symp. on Logics in Computer Science, IEEE 1988, pp. 133–141.
Degano, P. and Montanari, U., Concurrent Histories: A Basis for Observing Distributed Systems, Journal of Computer and System Sciences, Vol. 34, April/June 1987, No.2/3, pp. 422–461.
Gorrieri, R., Marchetti, S. and Montanari, U., A2CCS: A Simple Extension Of CCS For Handling Atomic Actions, Proc. CAAP 1988, Springer LNCS 299, pp. 258–270.
Meseguer, J. and Montanari, U., Petri Nets are Monoids, Technical Report SRI-CSL-88-3, CS Lab., SRI International, January 1988, also Information and Computation, to appear.
Meseguer, J. and Montanari, U., Petri Nets are Monoids: A New Algebraic Foundation for Net Theory, Proc. 3rd Symp. on Logics in Computer Science, IEEE 1988, pp. 155–164.
Milner, R., Notes on a Calculus for Communicating Systems, in: Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy, ed.), NATO ASI Series F, Vol. 14, pp. 205–228, Springer-Verlag, 1984.
Olderog, E.-R., Operational Petri Net Semantics for CCSP, in: Advances in Petri Nets 1987, (G. Rozenberg, ed.) LNCS 266, pp. 196–223, Springer-Verlag, 1987.
Plotkin, G., A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Aarhus University, Department of Computer Science, Aarhus, 1981.
Reisig, W., Petri Nets: An Introduction, EACTS Monographs on Theoretical Computer Science, Springer-Verlag, 1985.
Winskel, G., Petri Nets, Algebras, Morphisms and Compositionality, Info. and Co., 72, 197–238 (1987).
Winskel, G., Event Structures for CCS and Related Languages, PROC. 9 th ICALP, LNCS 140, Springer-Verlag, 1982, pp. 561–576.
Montanari, U. and Sgamma, M., Canonical Representatives for Observational Equivalence Classes, Proc. Colloquium On The Resolution Of Equations In Algebraic Structures, Lakeway, Texas, May 4–6, 1987, North-Holland, 1989, to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montanari, U., Yankelevich, D.N. (1989). An algebraic view of interleaving and distributed operational semantics for CCS. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poigné, A. (eds) Category Theory and Computer Science. Lecture Notes in Computer Science, vol 389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018342
Download citation
DOI: https://doi.org/10.1007/BFb0018342
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51662-0
Online ISBN: 978-3-540-46740-3
eBook Packages: Springer Book Archive