Concurrent bisimulations in Petri nets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4180788 (Why is no real title available?)
- scientific article; zbMATH DE number 4206024 (Why is no real title available?)
- scientific article; zbMATH DE number 4213438 (Why is no real title available?)
- scientific article; zbMATH DE number 3825184 (Why is no real title available?)
- scientific article; zbMATH DE number 3911719 (Why is no real title available?)
- scientific article; zbMATH DE number 3958739 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4045168 (Why is no real title available?)
- scientific article; zbMATH DE number 4060688 (Why is no real title available?)
- scientific article; zbMATH DE number 4074506 (Why is no real title available?)
- scientific article; zbMATH DE number 4094831 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 17804 (Why is no real title available?)
- scientific article; zbMATH DE number 176514 (Why is no real title available?)
- scientific article; zbMATH DE number 1988986 (Why is no real title available?)
- scientific article; zbMATH DE number 3995041 (Why is no real title available?)
- A calculus of communicating systems
- A distributed operational semantics of CCS based on condition/event systems
- Branching time and abstraction in bisimulation semantics
- Formal semantics of a class of high-level primitives of coordinating concurrent processes
- Maximality preserving bisimulation
- Refinement of actions and equivalence notions for concurrent systems
- Sequential and concurrent behaviour in Petri net theory
- Subset languages of Petri nets. I: The relationship to string languages and normal forms
Cited in
(47)- New Bisimulation Semantics for Distributed Systems
- A logic for true concurrency
- The limit of \(\operatorname{split}_n\)-language equivalence
- History-preserving bisimilarity for higher-dimensional automata via open maps
- Failures semantics based on interval semiwords is a congruence for refinement
- Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
- Behavioural logics for configuration structures
- Neighbourhood Contingency Bisimulation
- A Study on Team Bisimulations for BPP Nets
- Pomset bisimulation and unfolding for reset Petri nets
- scientific article; zbMATH DE number 1696467 (Why is no real title available?)
- Non sequential semantics for contextual P/T nets
- Maximality preserving bisimulation
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- scientific article; zbMATH DE number 7649934 (Why is no real title available?)
- scientific article; zbMATH DE number 5198970 (Why is no real title available?)
- 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
- Interleaving isotactics -- an equivalence notion on behaviour abstractions
- scientific article; zbMATH DE number 2064225 (Why is no real title available?)
- A stable non-interleaving early operational semantics for the pi-calculus
- Local model checking in a logic for true concurrency
- Reduction of event structures under history preserving bisimulation
- The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
- Concurrency, Synchronization, and Conflicts in Petri Nets
- 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 reduced maximality labeled transition system generation for recursive Petri nets
- A study on team bisimulation and H-team bisimulation for BPP 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
- Bisimulation and action refinement
- Causal Semantics for BPP Nets with Silent Moves
- Deciding true concurrency equivalences on finite safe nets (preliminary report)
- scientific article; zbMATH DE number 4119656 (Why is no real title available?)
- Adhesive DPO parallelism for monic matches
- Simultaneous Petri Net Synthesis
- Deciding true concurrency equivalences on safe, finite nets
- Separability in Conflict-Free Petri Nets
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)
