Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves

DOI10.1007/978-3-030-78089-0_5MaRDI QIDQ2117014zbMATH OpenOpenAlexFDO

Authors Roberto Gorrieri

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-78089-0_5

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Undecidability of bisimilarity for Petri nets and some related problems
• scientific article; zbMATH DE number 2102771
• scientific article; zbMATH DE number 1696467
• High undecidability of weak bisimilarity for Petri nets
• scientific article; zbMATH DE number 176758

Cites work

• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 3722109 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1302043 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• A calculus of mobile processes. I
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Branching bisimilarity is an equivalence indeed!
• Branching time and abstraction in bisimulation semantics
• Causal Semantics for BPP Nets with Silent Moves
• Concurrent bisimulations in Petri nets
• Formal verification of parallel programs
• Introduction to concurrency theory. Transition systems and CCS
• Nets, Terms and Formulas
• Process algebras for Petri nets. The alphabetization of distributed systems
• Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
• Team bisimilarity, and its associated modal logic, for BPP nets
• Team equivalences for finite-state machines with silent moves
• The \(\pi\)-calculus: A theory of mobile processes
• Undecidability of bisimilarity for Petri nets and some related problems

Cited in

(1)

• Team equivalences for finite-state machines 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)