Nets, sequential components and concurrency relations (Q797994)

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.