Skip to Main content Skip to Navigation
Reports

A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems

Radu Mateescu 1
1 VASY - System validation - Research and applications
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Boolean Equation Systems are a useful formalism for modeling various verification problems of finite-state concurrent systems, in particular the equivalence checking and the model checking problems. These problems can be solved on-the-fly (i.e., without constructing explicitly the state space of the system under analysis) by using a demand-driven construction and resolution of the corresponding boolean equation system. In this report, we present a generic software library dedicated to on-the-fly resolution of alternation-free boolean equation systems. Four resolution algorithms are currently provided by the library: A1 and A2 are general algorithms, the latter being optimized to produce small-depth diagnostics, whereas A3 and A4 are specialized algorithms for handling acyclic and disjunctive/conjunctive boolean equation systems in a memory-efficient way. The library is developed within the Cadp verification toolbox and is used for both on-the-fly equivalence checking (five widely-used equivalence relations are supported) and for on-the-fly model checking of alternation-free modal mu-calculus.
Document type :
Reports
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071875
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 7:04:16 PM
Last modification on : Thursday, November 19, 2020 - 1:00:27 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:42:26 PM

Identifiers

  • HAL Id : inria-00071875, version 1

Collections

Citation

Radu Mateescu. A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems. RR-4711, INRIA. 2003. ⟨inria-00071875⟩

Share

Metrics

Record views

245

Files downloads

425