A Study on Team Bisimulations for BPP Nets

DOI10.1007/978-3-030-51831-8_8zbMath1498.68185OpenAlexW3037801245MaRDI QIDQ5100755

Roberto Gorrieri

Publication date: 1 September 2022

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51831-8_8

Mathematics Subject Classification ID

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

Related Items

Characterising spectra of equivalences for event structures, logically ⋮ Interleaving vs True Concurrency: Some Instructive Security Examples ⋮ Causal Semantics for BPP Nets with Silent Moves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Introduction to concurrency theory. Transition systems and CCS
• Non-interleaving bisimulation equivalences on basic parallel processes
• Sequential and concurrent behaviour in Petri net theory
• Petri nets, event structures and domains. I
• Branching processes of Petri nets
• 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
• The non-sequential behaviour of Petri nets
• Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
• Three Partition Refinement Algorithms
• Nets, Terms and Formulas
• Interleaving vs True Concurrency: Some Instructive Security Examples