Partial model checking using networks of labelled transition systems and Boolean equation systems
From MaRDI portal
Publication:2851668
Recommendations
- Partial model checking using networks of labelled transition systems and Boolean equation systems
- Compositional and quantitative model checking (extended abstract)
- Partial model checking of modal equations: a survey
- Combining partial-order reductions with on-the-fly model-checking.
- A partial order approach to branching time logic model checking.
Cited in
(9)- A formal verification technique for behavioural model-to-model transformations
- Compositional verification of concurrent systems by combining bisimulations
- Equivalence checking 40 years after: a review of bisimulation tools
- Compositional and quantitative model checking (extended abstract)
- Sharp congruences adequate with temporal logics combining weak and strong modalities
- Partial model checking using networks of labelled transition systems and Boolean equation systems
- Compositional verification of asynchronous concurrent systems using CADP
- A quantitative partial model-checking function and its optimisation
- Cartesian difference categories
This page was built for publication: Partial model checking using networks of labelled transition systems and Boolean equation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851668)
