Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems

DOI10.2168/LMCS-9(4:1)2013zbMath1274.68195OpenAlexW2050691526MaRDI QIDQ2851668

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

zbMATH Keywords

automatamodel checkingtemporal logicconcurrencycompositional verification

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Equivalence checking 40 years after: a review of bisimulation tools ⋮ Cartesian difference categories ⋮ A formal verification technique for behavioural model-to-model transformations ⋮ Sharp Congruences Adequate with Temporal Logics Combining Weak and Strong Modalities ⋮ Compositional verification of asynchronous concurrent systems using CADP

Uses Software

• CADP
• Exp.Open
• CAESAR_SOLVE
• fc2tools
• CMC

This page was built for publication: Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems