starMC: an automata based CTL* model checker

Abstract

Model-checking of temporal logic formulae is a widely used technique for the verification of systems. CTL$^*$ is a temporal logic that allows to consider an intermix of both branching behaviours (like in CTL) and linear behaviours (LTL), overcoming the limitations of LTL (that cannot express “possibility”) and CTL (cannot fully express fairness). Nevertheless CTL$^*$ model-checkers are uncommon. This paper presents (1) the algorithms for a fully symbolic automata-based approach for CTL$^*$, and (2) their implementation in the open-source tool starMC, a CTL$^*$ model checker for systems specified as Petri nets. Testing has been conducted on thousands of formulas over almost a hundred models. The experiments show that the fully symbolic automata-based approach of starMC can compute the set of states that satisfy a CTL$^*$ formula for very large models (non trivial formulas for state spaces larger than 10480 states are evaluated in less than a minute).

A Truly Symbolic Linear-Time Algorithm for SCC Decomposition

“…In the everyday practice of model checking, systems are represented as symbolic, rather than explicit graphs. One predominant symbolic representation is via (reduced/ordered) Binary Decision Diagrams (BDDs) [9], which are found at the core of many classic and modern model checkers [13,23,19,24,3]. BDDs can offer exponential compactness of the huge state space typically involved in the model-checking task, by succinctly encoding symmetries abundant in the represented system.…”