Causal Semantics for BPP Nets with Silent Moves
From MaRDI portal
Publication:5164874
DOI10.3233/FI-2021-2039zbMath1496.68224OpenAlexW3173785988MaRDI QIDQ5164874
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2039
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to concurrency theory. Transition systems and CCS
- CCS expressions, finite state processes, and three problems of equivalence
- Generalizing the Paige-Tarjan algorithm by abstract interpretation
- 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
- A complete axiomatisation for observational congruence of finite-state behaviours
- Branching bisimilarity is an equivalence indeed!
- Team equivalences for finite-state machines with silent moves
- An \(O(m\log n)\) algorithm for stuttering equivalence and branching bisimulation
- 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
- Bisimilarity Minimization in O(m logn) Time
- Three Partition Refinement Algorithms
- Nets, Terms and Formulas
- Branching time and abstraction in bisimulation semantics
- Understanding Petri Nets
- A Study on Team Bisimulations for BPP Nets
- An O(m log n) algorithm for branching bisimilarity on labelled transition systems
