Partial model checking using networks of labelled transition systems and Boolean equation systems
DOI10.2168/LMCS-9(4:1)2013zbMATH Open1274.68195OpenAlexW2050691526MaRDI QIDQ2851668FDOQ2851668
Authors: Frédéric Lang, Radu Mateescu 
Publication date: 16 October 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-9(4:1)2013
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.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
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
Uses Software
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)
