For the most recent entries see the Petri Nets Newsletter.

Finite Representations of CCS and TCSP Programs by Automata and Petri Nets.

Taubner, D.

Lecture Notes in Computer Science, Vol. 369, pages 1-168 pp.. Berlin: Springer-Verlag,, 1989.

Abstract: This work relates differnt approaches for the modelling of parallel processes. Within a uniform framework the syntax and the operational semantics of CCS and TCSP are explained. The authors consider both, Milner's interleaving semantics wich is based on infinite transition systems, as well as the new distributed semantics which is based on infinite safe nets. The main part of their work contains three syntax-driven constructions of transition systems, safe nets, and predicate/transition nets.


Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography