True Concurrency Can Be Easy
share
Step net bisimulation is a coinductive behavioral relation for finite Petri nets, which is a smooth generalization of the definition of standard step bisimulation <cit.> on finite Petri nets. Its induced equivalence offers an alternative, much simpler characterization of causal-net bisimilarity <cit.>, as it does not resort to any causality structure, and of structure-preserving bisimilarity <cit.>, as it does not require bijective mappings between related markings. We show that step net bisimilarity can be characterized logically by means of a suitable modal logic, called NML (acronym of net modal logic): two markings are step net bisimilar if and only if they satisfy the same NML formulae.
READ FULL TEXT