Abstract
We provide a Petri net semantics for a subset of CCSP, the union of Milner's CCS and Hoare's CSP. It assigns to each process term in the subset a labelled, one-safe place/transition net. As opposed to many other approaches to Petri net semantics, our definition is operational as it is based on Plotkin-style transition rules. These rules are inspired by work of Degano, DeNicola and Montanari, but differ in the way they model the interplay of the central concepts in CCSP: concurrency, nondeterminism and recursion. To discuss these differences, we propose criteria for a good Petri net semantics for CCSP.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K.R. Apt, Formal justification of a proof system for communicating sequential processes, J.ACM 30 (1983) 197–216.
J.W. de Bakker, Mathematical Theory of Program Correctness ( Prentice Hall, London, 1980 ).
E. Best, COSY: its relation to nets and to CSP, in: Brauer, W. Reisig, G. Rozenberg (Eds.), Proc. Advanced Course on Petri Nets, Bad Honnef, 1986.
E. Best, C. Fernandez, Notations and terminology on Petri nets, Arbeitspaiere der GMD Nr.195, Gesellschaft Math. Datenverarbeitung,Bonn, 1986.
S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A theory of communicating sequential processes, J.ACM 31 (1984) 560–599.
M. Broy, Process semantics of communicating concurrent programs, Bericht MIP-8602, Fak. Math. u. Inform., Univ. Passau, 1986.
R.H. Campbell, A.N. Habermann, The specification of process synchronisation by path expressions, LNCS 16 (Springer-Verlag, 1974).
L. Czaja, Making nets structured and abstract, in G. Rozenberg (Ed.), Advances in Petri Nets 1985, LNCS 222 (Springer-Verlag, 1985) 181–202.
F. DeCindio, DeMichelis, L. Pomello, C. Simone, in: A. Pagnoni, G. Rozenberg (Eds.), Applications and Theory of Petri Nets, Informatik-Fachberichte 66 (Springer-Verlag, 1983) 40–59.
P. Degano, R. DeNicola, U. Montanari, A new operational semantics for CCS based on condition/event systems, Nota Interna B4-42, Dept. of Computer Science, Univ. Pisa, 1986.
R. v. Glabbeek, F. Vaangrager, Petri net models for algebraic theories of concurrency, to appear in: J.W. de Bakker, P. Treleaven (Eds.), Proc. PARLE, Eindhoven, 1987.
U. Goltz, Building structured Petri nets, Arbeitspapiere der GMD Nr. 223, Gesellschaft Math. Datenverarbeitung, Bonn, 1986.
U. Goltz, R. Loogen, Towards a non-interleaving semantics model for CSP-like languages, Schriften zur Inform. u. Angew. Math., Nr. 105, RWTH Aachen, 1985.
U. Goltz, A. Mycroft, On the relationship of CCS and Petri nets, in: J. Paredaens (Ed.), Proc. 11th ICALP, LNCS 172 ( Springer-Verlag, 1984 ) 196–208.
M. Hennessy, G.D. Plotkin, Full abstraction for a simple programming language, in: J. Becvar (Ed.), 8th MFCS, LNCS 74 (Springer-Verlag, 1979 ) 108–120.
C.A.R. Hoare, Communicating Sequential Processes (Prentice Hall, London, 1985).
R.M. Keller, Formal verification of parallel programs, Comm. ACM (1976) 371–384.
P.E. Lauer, R.H. Campbell, Formal semantics of a class of highlevel primitives for coordinating concurrent processes, Acta Inform. 5 (1975) 297–332.
R. Loogen, Ein semantisches Modell für nichtdeterministische parallele Prozesse, Diplomarbeit, Inst. f. Inform., RWTH Aachen, 1985.
R. Milner, A Calculus of Communicating Systems, LNCS 92 (Springer-Verlag, 1980 ).
E.-R. Olderog, Process theory: semantics, specification and verification, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg, (Eds.), Current Trends in Concurrency, LNCS 224 (Springer-Verlag, 1986) 442–509.
E.-R. Olderog, Semantics of concurrent processes: the search for structure and abstraction, part I and II, tutorial, Bull. EATCS 28 (1986) 73–97 and 29 (1986) 96–117.
E.-R. Olderog, C.A.R. Hoare, Specification-oriented semantics of communicating processes, Acta Inform. 23 (1986) 9–66.
D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th GI Conf. on Theoret. Comp. Science, LNCS 104 (Springer-Verlag, 1981).
G.D. Plotkin, Structured approach to operational semantics, Tech. Report DAIMI FN-19, Comp. Science Dept., Aarhus Univ., 1981.
G.D. Plotkin, An operational semantics for CSP, in: D. Bjorner (Ed.), Formal Description of Programmiong Concepts II (North-Holland, Amsterdam, 1982) 199–225.
L. Pomello, Some equivalence notions for concurrent systems — an overview, in: G, Rozenberg (Ed.), Advances in Petri Nets 1985, LNCS 222 ( Springer-Verlag, 1985 ) 381–400.
M.O. Rabin, D.S. Scott, Finite automata and their decision problems, IBM J. Res. 3:2, 1959.
W. Reisig, Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness, in: J. Paredaens (Ed.), Proc. 11th ICALP, LNCS 172 (Springer-Verlag, 1984) 403–413.
W. Reisig, Petri Nets: An Introduction, EATCS Monographs in Computer Science (Springer-Verlag, Berlin, 1985).
D.A. Taubner, Two net oriented semantics for TCSP, Bericht Nr. 116/85, Fachbereich Inform., Univ. Hamburg, 1985.
G. Winskel, A new definition of morphism on Petri nets, in: M. Fontet, K. Mehlhorn (Eds.), Proc. 1st STACS, LNCS 166 (Springer-Verlag, 1984).
G. Winskel, Event structures, to appear in: W. Brauer, W. Reisig, G. Rozenberg (Eds.), Proc. Advanced Course on Petri Nets, Good Honnef, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olderog, ER. (1987). Operational Petri net semantics for CCSP. In: Rozenberg, G. (eds) Advances in Petri Nets 1987. APN 1986. Lecture Notes in Computer Science, vol 266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18086-9_27
Download citation
DOI: https://doi.org/10.1007/3-540-18086-9_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18086-9
Online ISBN: 978-3-540-47743-3
eBook Packages: Springer Book Archive