scientific article

zbMATH Open0769.68106MaRDI QIDQ4036588FDOQ4036588

Walter Vogler

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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)

Cited In (15)

• Title not available (Why is that?)
• Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
• The decidability border of hereditary history preserving bisimilarity
• Causality, Behavioural Equivalences, and the Security of Cyberphysical Systems
• Petri nets and bisimulation
• Interleaving vs True Concurrency: Some Instructive Security Examples
• Timed processes of Timed Petri Nets
• Undecidability of domino games and hhp-bisimilarity.
• A Logic for True Concurrency
• Title not available (Why is that?)
• Minimal transition systems for history-preserving bisimulation
• Local Model Checking in a Logic for True Concurrency
• Deciding true concurrency equivalences on finite safe nets (preliminary report)
• Deciding true concurrency equivalences on safe, finite nets
• New Bisimulation Semantics for Distributed Systems

   Recommendations

• Minimal transition systems for history-preserving bisimulation 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)