Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
From MaRDI portal
Publication:2117014
DOI10.1007/978-3-030-78089-0_5zbMATH Open1490.68140OpenAlexW3170711220MaRDI QIDQ2117014FDOQ2117014
Publication date: 21 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-78089-0_5
Recommendations
Cites Work
- Concurrent bisimulations in Petri nets
- Title not available (Why is that?)
- Title not available (Why is that?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A calculus of mobile processes. I
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal verification of parallel programs
- Branching time and abstraction in bisimulation semantics
- Title not available (Why is that?)
- The \(\pi\)-calculus: A theory of mobile processes
- Nets, Terms and Formulas
- Title not available (Why is that?)
- Undecidability of bisimilarity for Petri nets and some related problems
- Branching bisimilarity is an equivalence indeed!
- Introduction to concurrency theory. Transition systems and CCS
- Process algebras for Petri nets. The alphabetization of distributed systems
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
- Team equivalences for finite-state machines with silent moves
- Team bisimilarity, and its associated modal logic, for BPP nets
- Causal Semantics for BPP Nets with Silent Moves
This page was built for publication: Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117014)
