zbMATH — the first resource for mathematics

CSP-programs as nets with individual tokens. (English) Zbl 0571.68044
Advances in Petri nets 1984, Lect. Notes Comput. Sci. 188, 169-196 (1985).
[For the entire collection see Zbl 0556.00014.]
We define a subclass of predicate/transition-nets and show how to translate CSP-programs into such nets. We consider a subset of CSP for which M. Hennessy, W. Li and G. Plotkin have given an operational semantics [Proc. 2nd Int. Conf. Distributed Computing, Paris 1981]. We show that the firing sequences of our net translation correspond to this operational semantics. Additionally, we also give a non-interleaving semantics to CSP by considering unfoldings and processes of the net translation. This enables us to analyse CSP-programs applying net theoretic methods.

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
68N25 Theory of operating systems