Nets, sequential components and concurrency relations (Q797994)
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 3870603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nets, sequential components and concurrency relations |
scientific article; zbMATH DE number 3870603 |
Statements
Nets, sequential components and concurrency relations (English)
0 references
1984
0 references
Two approaches to the notion of concurrency on the system level are discussed. One starts with a given decomposition of a net into sequential components. In the other one the concurrency relation is defined from a given marking class. It is shown that the postulate about a common element for every global system state and every sequential component under minor additional conditions imply the decomposability of the net into finite state machines.
0 references
Petri nets
0 references
densities
0 references
concurrency
0 references
decomposition
0 references
sequential components
0 references
marking class
0 references
finite state machines
0 references
0 references
0.8668677
0 references
0 references
