Abstract
We provide a simple non-interleaved operational semantics for CCS in terms of asynchronous transition systems. We identify the concurrency present in the system in a natural way, in terms of events occurring at independent locations in the system.
We extend the standard interleaving transition system for CCS by introducing labels on the transitions with information about the locations of events. We then show that the resulting transition system is an asynchronous transition system which has the additional property of being elementary, which means that it can also be represented by a 1-safe net.
We also introduce a notion of bisimulation on asynchronous transition systems which preserves independence. We conjecture that the induced equivalence on CCS processes coincides with the notion of location equivalence proposed by Boudol et al.
The author's stay in Denmark was supported by a grant from the Aarhus University Research Foundation.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. Aceto: A static view of localities, Report 1483, INRIA, Sophia-Antipolis (1991).
M. A. Bednarczyk: Categories of asynchronous systems, PhD Thesis, Report 1/88, Computer Science, University of Sussex (1988).
G. Boudol, I. Castellani: Three equivalent semantics for CCS, Springer LNCS 469, 96–141 (1990).
G. Boudol, I. Castellani, M. Hennessy, A. Kiehn: Observing localities, Springer LNCS 520, 93–102 (1991).
G. Boudol, I. Castellani, M. Hennessy, A. Kiehn: A theory of processes with localities, Report 1632, INRIA, Sophia-Antipolis (1992)
P. Degano, R. de Nicola, U. Montanari: A distributed operational semantics for CCS based on Condition/Event Systems, Acta Informatica, 26, 59–91 (1988).
A. Ehrenfeucht, G. Rozenberg: Partial 2-structures; Part II: State spaces of concurrent systems, Ada Informatica, 27, 348–368 (1990).
G.L. Ferrari, U. Montanari: Towards the unification of models for concurrency, Springer LNCS 431, 162–176 (1990).
R. Milner: Communication and Concurrency, Prentice-Hall, London (1989).
M. Mukund: Transition system models for concurrency, Report DAIMI-PB-399, Computer Science Department, Aarhus University, Aarhus, Denmark (1992).
M. Mukund, M. Nielsen: CCS, locations and asynchronous transition systems, Report DAIMJ-PB-395, Computer Science Department, Aarhus University, Aarhus, Denmark (1992).
M. Nielsen, G. Rozenberg, P.S. Thiagarajan: Elementary transition systems, Theoretical Computer Science, 96, 1, 3–33 (1992).
E.-R. Olderog: Nets, Terms and Formulas, Cambridge University Press, Cambridge (1991).
M.W. Shields: Concurrent machines, Computer Journal, 28, 449–465 (1985).
G. Winskel, M. Nielsen: Models for concurrency, (to appear in S. Abramsky, D.M. Gabbay, T.S.E. Maibaum eds. Handbook of Logic in Computer Science).
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mukund, M., Nielsen, M. (1992). CCS, locations and asynchronous transition systems. In: Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1992. Lecture Notes in Computer Science, vol 652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56287-7_116
Download citation
DOI: https://doi.org/10.1007/3-540-56287-7_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56287-0
Online ISBN: 978-3-540-47507-1
eBook Packages: Springer Book Archive