Compositional verification of concurrent systems by combining bisimulations
From MaRDI portal
Publication:6535949
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
- Property preserving abstractions for the verification of concurrent systems
Cites work
- scientific article; zbMATH DE number 3926220 (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 177514 (Why is no real title available?)
- A Theory of Communicating Sequential Processes
- 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
- Partial model checking using networks of labelled transition systems and Boolean equation systems
- Propositional dynamic logic of looping and converse is elementarily decidable
- Propositional dynamic logic of regular programs
- Results on the propositional \(\mu\)-calculus
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 Q6535949)