In: Valette, R.: Lecture Notes in Computer Science, Vol. 815; Application and Theory of Petri Nets 1994, Proceedings 15th International Conference, Zaragoza, Spain, pages 239-257. Springer-Verlag, 1994.
Abstract: Net semantic s for CCS-like calculi have been developed in order to combine the explicit parallelism of Petri nets and their graphical intuition with the techniques for modular design and analysis of process algebras. In this paper we pursue the coverse: starting from a place/Transition system we construct an equivalent term representation. The resulting terms include the operators action, nondeterminism, parallelism, recursion and restriction. We prove the correctness of the term semantics according to bisimulation equivalence and investigate stronger correctness notions