On the relationship of CCS and Petri nets. (English) Zbl 0562.68049

Goltz, Ursula; Mycroft, Alan

Automata, languages and programming, 11th Colloq., Antwerp/Belg. 1984, Lect. Notes Comput. Sci. 172, 196-208 (1984).

[For the entire collection see Zbl 0543.00014.]
A translation method of pure CCS [see R. Milner, A calculus of communicating systems (1980; Zbl 0452.68027)] into possibly infinite occurrence nets is defined and it is shown that this translation corresponds to Milner’s CCS semantics. Furthermore, a method for translating a subset of CCS programs into finite marked Petri nets is given, although the problem: ”exactly which subset of CCS is expressible by finite marked nets” is left open.

Reviewer: R.Janicki

MSC:

68Q85	Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25	Theory of operating systems
68Q65	Abstract data types; algebraic specification

Keywords:

calculus of communicating systems; occurrence nets; CCS semantics; CCS programs; finite marked Petri nets