Compositional verification of concurrent systems by combining bisimulations
From MaRDI portal
(Redirected from Publication:2147689)
Recommendations
- Compositional verification of concurrent systems by combining bisimulations
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Automatic verification of concurrent systems using a formula-based compositional approach
- Compositionality and locality for improving model checking in the selective mu-calculus
- Compositional verification of asynchronous concurrent systems using CADP
Cites work
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 4056971 (Why is no real title available?)
- 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 177254 (Why is no real title available?)
- scientific article; zbMATH DE number 177514 (Why is no real title available?)
- scientific article; zbMATH DE number 1556014 (Why is no real title available?)
- scientific article; zbMATH DE number 1759425 (Why is no real title available?)
- A partial order approach to branching time logic model checking.
- An automata theoretic decision procedure for the propositional mu- calculus
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Branching time and abstraction in bisimulation semantics
- Compositional verification of asynchronous concurrent systems using CADP
- Confluence for process verification
- Derivatives of Regular Expressions
- Modeling and analysis of communicating systems
- Partial model checking using networks of labelled transition systems and Boolean equation systems
- Partial-order reduction in the weak modal mu-calculus
- Propositional dynamic logic of looping and converse is elementarily decidable
- Propositional dynamic logic of regular programs
- Results on the propositional \(\mu\)-calculus
- Sequential and distributed on-the-fly computation of weak tau-confluence
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Three logics for branching bisimulation
Cited in
(8)- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- On the computation of counterexamples in compositional nonblocking verification
- scientific article; zbMATH DE number 4022620 (Why is no real title available?)
- On the complexity of verifying concurrent transition systems
- \textsc{ULTraS} at work: compositionality metaresults for bisimulation and trace semantics
- Compositional Nonblocking Verification Using Generalized Nonblocking Abstractions
- Compositional verification of concurrent systems by combining bisimulations
- Deriving Bisimulation Congruences for Conditional Reactive Systems
This page was built for publication: Compositional verification of concurrent systems by combining bisimulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147689)
