Abstract
We give a partial order semantics to (pure) CCS via a translation into Petri nets and prove, that the interleaved behaviour of the resulting nets is equivalent to Milner's semantics. We show that a large class of CCS programs can be represented by finite nets and that this is impossible for the whole CCS.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Abramsky, S. Eliminating local non-determinism: a new semantics for CCS. Report 290, Computer systems laboratory, Queen Mary College, London, 1981.
de Bakker, et al. Linear time and branching time semantics for recursion with merge. LNCS 154: Proceedings 10th ICALP, Barcelona, 1983.
Brauer, W. (ed) Net theory and applications. LNCS 84: Proceedings of the advanced course on net theory and applications, Hamburg, 1980.
de Cindio, et al. Superposed automata nets. IF 52: Selected papers from the 1st and 2nd european workshop on applications and theory of Petri nets, 1982.
de Cindio, et al. Milner's CCS and Petri nets. IF 66: Selected papers from the 3rd european workshop of applications and theory of Petri nets, 1983.
Goltz, U., Mycroft, A. On the relationship of CCS and Petri nets. Research report, Inst. för informationsbehandling, Chalmers TH, Göteborg, 1984.
Goltz, U., Mycroft, A. Net behaviour representations and equivalence notions. Submitted to 4th european workshop on applications and theory of Petri nets, 1984.
Genrich, H.J., Stankiewicz-Wiechno, E. A dictionary of some basic notions of net theory. In /Br/.
Milner, R. A calculus of communicating systems. LNCS 92, 1980.
Nielsen, M., Plotkin, G.D., Winskel, G. Petri nets, event structures and domains. Theoretical Computer Science 13(1) 1981.
Reisig, W. Petrinetze — eine einführung. Springer-Verlag, 1982. (To appear in english.)
Reisig, W. Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness. LNCS: Proceedings 11th ICALP, Antwerp, 1984. (This volume.)
Winskel, G. Event structure semantics for CCS and related languages. DAIMI report PB-159, Århus University. Shorter version in LNCS 140: Proceedings 9th ICALP, 1982.
Winskel, G. A new definition of morphism on Petri nets. LNCS: Proceedings 1st symposium on theoretical aspects of computer science, Paris, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goltz, U., Mycroft, A. (1984). On the relationship of CCS and petri nets. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_18
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive