True Concurrency Can Be Easy
Abstract
Step net bisimulation is a coinductive behavioral relation for finite Petri nets, which is a smooth generalization of the definition of standard step bisimulation NT84 on finite Petri nets. Its induced equivalence offers an alternative, much simpler characterization of causal-net bisimilarity G15,Gor22, as it does not resort to any causality structure, and of structure-preserving bisimilarity G15, 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.