scientific article; zbMATH DE number 176758

MaRDI QIDQ4036588zbMATH OpenFDO

Authors Walter Vogler

Publication date 18 May 1993

zbMATH Keywords

causalitybranchingPetri netsaction refinement\(OM\)-bisimulationfinite safe netsHistory preserving bisimulationordered markings of nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Minimal transition systems for history-preserving bisimulation
• scientific article; zbMATH DE number 1617304
• Publication:4941914
• scientific article; zbMATH DE number 1497782
• scientific article; zbMATH DE number 1500529

Cited in

(16)

• New Bisimulation Semantics for Distributed Systems
• A logic for true concurrency
• The decidability border of hereditary history preserving bisimilarity
• scientific article; zbMATH DE number 1418351 (Why is no real title available?)
• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
• Petri nets and bisimulation
• Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
• Interleaving vs True Concurrency: Some Instructive Security Examples
• Undecidability of domino games and hhp-bisimilarity.
• Local model checking in a logic for true concurrency
• scientific article; zbMATH DE number 1617304 (Why is no real title available?)
• Minimal transition systems for history-preserving bisimulation
• Timed processes of timed Petri nets
• Causality, behavioural equivalences, and the security of cyberphysical systems
• Deciding true concurrency equivalences on finite safe nets (preliminary report)
• Deciding true concurrency equivalences on safe, finite nets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036588)