A study on team bisimulation and H-team bisimulation for BPP nets
From MaRDI portal
Publication:2055961
DOI10.1016/j.tcs.2021.09.037OpenAlexW3204143303MaRDI QIDQ2055961
Publication date: 1 December 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.09.037
Petri netsaxiomatizationHennessy-Milner modal logicBPP process algebrafully-concurrent bisimulationteam bisimulation
Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Uses Software
Cites Work
- A theory of processes with durational actions
- Results on the propositional \(\mu\)-calculus
- Introduction to concurrency theory. Transition systems and CCS
- Non-interleaving bisimulation equivalences on basic parallel processes
- A complete inference system for a class of regular behaviours
- Sequential and concurrent behaviour in Petri net theory
- Concurrent systems and inevitability
- Petri nets, event structures and domains. I
- Branching processes of Petri nets
- A spatial logic for concurrency. I
- Bisimulation from open maps
- 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
- Decidability of performance equivalence for basic parallel processes
- Concurrent bisimulations in Petri nets
- The non-sequential behaviour of Petri nets
- Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
- Distributed bisimulations
- Algebraic laws for nondeterminism and concurrency
- Three Partition Refinement Algorithms
- Nets, Terms and Formulas
- Branching time and abstraction in bisimulation semantics
- Understanding Petri Nets
- Interleaving vs True Concurrency: Some Instructive Security Examples
- Reactive Systems
- A Logic for True Concurrency
- CONCUR 2005 – Concurrency Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item