scientific article; zbMATH DE number 4060688

From MaRDI portal
Publication:3795192





[For the entire collection see Zbl 0643.00024.] 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 (no restriction and relabelling, only guarded choice), these operations yield a net semantics with a clear distinction of concurrency and nondeterminism. It is shown that the usual interleaving semantics is retrievable from the net semantics. Partial order semantics and equivalence notions for labelled P/T-systems are discussed. This shows how the intuitive causal dependencies in a CCS program are represented via the net semantics.




Cited in
(35)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795192)