Publication:4036588
From MaRDI portal
zbMath0769.68106MaRDI QIDQ4036588
Publication date: 18 May 1993
Petri nets; causality; branching; action refinement; \(OM\)-bisimulation; finite safe nets; History preserving bisimulation; ordered markings of nets
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Deciding true concurrency equivalences on finite safe nets (preliminary report), Minimal transition systems for history-preserving bisimulation, Timed processes of Timed Petri Nets, Interleaving vs True Concurrency: Some Instructive Security Examples, A Logic for True Concurrency, Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets, Petri nets and bisimulation, The decidability border of hereditary history preserving bisimilarity, Deciding true concurrency equivalences on safe, finite nets, Undecidability of domino games and hhp-bisimilarity., Local Model Checking in a Logic for True Concurrency, Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems, New Bisimulation Semantics for Distributed Systems