No label defined (Q3795192)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4060688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4060688 |
Statements
1988
0 references
finite Petri nets
0 references
net semantics
0 references
concurrency
0 references
nondeterminism
0 references
Partial order semantics
0 references
equivalence notions
0 references
labelled P/T-systems
0 references
CCS program
0 references
0.93007267
0 references
0.92813855
0 references
0.8799882
0 references
0.8699816
0 references
[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.
0 references