Concurrent bisimulations in Petri nets
From MaRDI portal
DOI10.1007/BF01178506zbMATH Open0718.68034MaRDI QIDQ2639636FDOQ2639636
Authors: Eike Best, Raymond Devillers, Astrid Kiehn, Lucia Pomello 
Publication date: 1991
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Refinement of actions and equivalence notions for concurrent systems
- A calculus of communicating systems
- Branching time and abstraction in bisimulation semantics
- Title not available (Why is that?)
- Sequential and concurrent behaviour in Petri net theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- A distributed operational semantics of CCS based on condition/event systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Subset languages of Petri nets. I: The relationship to string languages and normal forms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximality 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?)
- Formal semantics of a class of high-level primitives of coordinating concurrent processes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (47)
- The limit of \(\operatorname{split}_n\)-language equivalence
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- History-preserving bisimilarity for higher-dimensional automata via open maps
- Failures semantics based on interval semiwords is a congruence for refinement
- Neighbourhood Contingency Bisimulation
- Behavioural logics for configuration structures
- A Study on Team Bisimulations for BPP Nets
- Non sequential semantics for contextual P/T nets
- Title not available (Why is that?)
- Pomset bisimulation and unfolding for reset Petri nets
- Maximality preserving bisimulation
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
- Title not available (Why is that?)
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Title not available (Why is that?)
- Interleaving vs True Concurrency: Some Instructive Security Examples
- Normalization of place/transition-systems preserves net behaviour
- Configuration structures, event structures and Petri nets
- Verification of finite-state machines: a distributed approach
- Title not available (Why is that?)
- Interleaving isotactics -- an equivalence notion on behaviour abstractions
- A stable non-interleaving early operational semantics for the pi-calculus
- Local model checking in a logic for true concurrency
- The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
- Concurrency, Synchronization, and Conflicts in Petri Nets
- Reduction of event structures under history preserving bisimulation
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
- Minimal transition systems for history-preserving bisimulation
- Symmetries, local names and dynamic (de)-allocation of names
- On the expressiveness of higher dimensional automata
- Towards a unified view of bisimulation: A comparative study
- A study on team bisimulation and H-team bisimulation for BPP nets
- A reduced maximality labeled transition system generation for recursive Petri nets
- Petri net reactive modules
- Team equivalences for finite-state machines with silent moves
- Team bisimilarity, and its associated modal logic, for BPP nets
- Improved implementations via a new structural equivalence on labeled nets
- Causal Semantics for BPP Nets with Silent Moves
- Deciding true concurrency equivalences on finite safe nets (preliminary report)
- Bisimulation and action refinement
- Title not available (Why is that?)
- Simultaneous Petri Net Synthesis
- Adhesive DPO parallelism for monic matches
- Separability in Conflict-Free Petri Nets
- Deciding true concurrency equivalences on safe, finite nets
- New Bisimulation Semantics for Distributed Systems
- A logic for true concurrency
This page was built for publication: Concurrent bisimulations in Petri nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2639636)
