For the most recent entries see the Petri Nets Newsletter.

On Representing CCS Programs by Finite Petri Nets.

Goltz, U.

Gesellschaft für Mathematik und Datenverarbeitung mbH, Sankt Augustin, Arbeitspapiere der GMD No. 290, 1987.

Abstract: A non-interleaving semantics for a subset of CCS using finite place/transition-systems is presented. Straightforward constructions on nets for CCS operations are given. When restricting the language appropriately, these operations yield a net semantics with a clear distinction of concurrency and nondeterminism.

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

Back to the Petri Nets Bibliography