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.