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

DOI10.1007/978-3-030-78089-0_5zbMath1490.68140OpenAlexW3170711220MaRDI QIDQ2117014

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Undecidability of bisimilarity for Petri nets and some related problems
• Introduction to concurrency theory. Transition systems and CCS
• A calculus of mobile processes. I
• Branching bisimilarity is an equivalence indeed!
• Team equivalences for finite-state machines with silent moves
• Team bisimilarity, and its associated modal logic, for BPP nets
• Process algebras for Petri nets. The alphabetization of distributed systems
• Concurrent bisimulations in Petri nets
• Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
• Nets, Terms and Formulas
• Formal verification of parallel programs
• Branching time and abstraction in bisimulation semantics
• Causal Semantics for BPP Nets with Silent Moves
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves