Team bisimilarity, and its associated modal logic, for BPP nets
From MaRDI portal
Publication:2231652
Recommendations
Cites work
- A complete inference system for a class of regular behaviours
- A logic for true concurrency
- A spatial logic for concurrency. I
- A theory of processes with durational actions
- Algebraic laws for nondeterminism and concurrency
- Bisimulation from open maps
- Branching time and abstraction in bisimulation semantics
- CONCUR 2005 – Concurrency Theory
- Concurrent bisimulations in Petri nets
- Decidability of performance equivalence for basic parallel processes
- Distributed bisimulations
- Formal verification of parallel programs
- Foundations of Software Science and Computational Structures
- Handbook of process algebra
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 1809623 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4074506 (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 17804 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 86276 (Why is no real title available?)
- scientific article; zbMATH DE number 1302047 (Why is no real title available?)
- scientific article; zbMATH DE number 1497782 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 4119653 (Why is no real title available?)
- Interleaving vs True Concurrency: Some Instructive Security Examples
- Introduction to bisimulation and coinduction
- Introduction to concurrency theory. Transition systems and CCS
- Nets, Terms and Formulas
- Non-interleaving bisimulation equivalences on basic parallel processes
- On the relationship between spatial logics and behavioral simulations
- Process algebras for Petri nets. The alphabetization of distributed systems
- Reactive Systems
- Results on the propositional \(\mu\)-calculus
- Sequential and concurrent behaviour in Petri net theory
- Structure preserving bisimilarity, supporting an operational Petri net semantics of CCSP
- Three Partition Refinement Algorithms
- Undecidability of bisimilarity for Petri nets and some related problems
- Understanding Petri Nets
- Unique decomposition of processes
- Verification of finite-state machines: a distributed approach
Cited in
(6)- A study on team bisimulation and H-team bisimulation for BPP nets
- Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
- Team equivalences for finite-state machines with silent moves
- Characterising spectra of equivalences for event structures, logically
- A Study on Team Bisimulations for BPP Nets
- Axiomatizing Team Equivalence for Finite-State Machines
This page was built for publication: Team bisimilarity, and its associated modal logic, for BPP nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2231652)
