Reduction and Design of Well-behaved Concurrent Systems

It is shown that each live and safe free-choice system without frozen token can be reduced either to a live and safe marked T-graph (marked graph) or to a live and safe marked P-graph (state machine). The four proposed reduction rules are purely local and preserve the behavioural properties in both directions. Hence the method can be used for both, effective analysis and correct design.