Concurrent bisimulations in Petri nets

DOI10.1007/BF01178506zbMath0718.68034MaRDI QIDQ2639636

Astrid Kiehn, Raymond Devillers, Eike Best, Lucia Pomello

Publication date: 1991

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

Petri netsbisimulationmodel of concurrency

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (38)

History-preserving bisimilarity for higher-dimensional automata via open maps ⋮ Behavioural logics for configuration structures ⋮ Minimal transition systems for history-preserving bisimulation ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Configuration structures, event structures and Petri nets ⋮ Interleaving isotactics -- an equivalence notion on behaviour abstractions ⋮ Step bisimulation is pomset equivalence on a parallel language without explicit internal choice ⋮ Normalization of place/transition-systems preserves net behaviour ⋮ Reduction of event structures under history preserving bisimulation ⋮ Deciding true concurrency equivalences on safe, finite nets ⋮ Verification of finite-state machines: a distributed approach ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ A Study on Team Bisimulations for BPP Nets ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Unnamed Item ⋮ A reduced maximality labeled transition system generation for recursive Petri nets ⋮ Team equivalences for finite-state machines with silent moves ⋮ Local Model Checking in a Logic for True Concurrency ⋮ Deciding true concurrency equivalences on finite safe nets (preliminary report) ⋮ Non sequential semantics for contextual P/T nets ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ The limit of splitn-language equivalence ⋮ Maximality preserving bisimulation ⋮ Bisimulation and action refinement ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus ⋮ On the expressiveness of higher dimensional automata ⋮ Petri net reactive modules ⋮ A Logic for True Concurrency ⋮ New Bisimulation Semantics for Distributed Systems ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ Failures semantics based on interval semiwords is a congruence for refinement ⋮ Towards a unified view of bisimulation: A comparative study ⋮ Adhesive DPO Parallelism for Monic Matches ⋮ Pomset bisimulation and unfolding for reset Petri nets ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves

Cites Work

• Subset languages of Petri nets. I: The relationship to string languages and normal forms
• A distributed operational semantics of CCS based on condition/event systems
• Sequential and concurrent behaviour in Petri net theory
• A calculus of communicating systems
• Maximality preserving bisimulation
• Formal semantics of a class of high-level primitives of coordinating concurrent processes
• Branching time and abstraction in bisimulation semantics
• Refinement of actions and equivalence notions for concurrent systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concurrent bisimulations in Petri nets