Compositional verification of priority systems using sharp bisimulation
From MaRDI portal
Cites work
- A journey from process algebra via timed automata to model learning. Essays dedicated to Frits Vaandrager on the occasion of his 60th birthday
- A Theory of Communicating Sequential Processes
- An O(m n) algorithm for computing stuttering equivalence and branching bisimulation
- An O(m n) algorithm for branching bisimilarity on labelled transition systems
- Bisimilarity Minimization in O(m logn) Time
- Branching time and abstraction in bisimulation semantics
- Branching time and orthogonal bisimulation equivalence
- Compositional verification of asynchronous concurrent systems using CADP
- Compositional verification of concurrent systems by combining bisimulations
- Deciding orthogonal bisimulation
- Depth-First Search and Linear Graph Algorithms
- Distributed branching bisimulation reduction of state spaces
- Dynamic partial-order reduction for model checking software
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177845 (Why is no real title available?)
- scientific article; zbMATH DE number 4001464 (Why is no real title available?)
- Priority in process algebra.
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Sigref – A Symbolic Bisimulation Tool Box
This page was built for publication: Compositional verification of priority systems using sharp bisimulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564171)
