Model checking Duration Calculus: a practical approach

Abstract

Abstract. Model checking of real-time systems against Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. The existing algorithms provide a limited DC coverage and do not support compositional verification. We propose a translation algorithm that advances the applicability of model checking tools to realistic applications. Our algorithm significantly extends the subset of DC that can be checked automatically. The central part of the algorithm is the automatic decomposition of DC specifications into sub-properties that can be verified independently. The decomposition is based on a novel distributive law for DC. We implemented the algorithm in a tool chain for the automated verification of systems comprising data, communication, and real-time aspects. We applied the tool chain to verify safety properties in an industrial case study from the European Train Control System (ETCS).

An Implementation Relation and Test Framework for Timed Distributed Systems

“…Similar specifications can found, e.g. in [20] and in [21]. The overall Train Control System (TCS) contains two Train Local Controllers (TLCs), one per train (say train 1 and train 2), going in the same direction on a rolling stock.…”

Constraint solving for interpolation

“…We applied ARMC to verify safety properties of train controller systems [26]. These examples depend crucially on the ability of our algorithm to handle strict inequalities directly.…”

“…Our experiments with Blast on Windows device drivers provide a direct comparison with the existing tool FOCI [23], and show promising running times in favour of the constraint based approach. Our method can handle systems which pose problems to other interpolation-based provers: It allowed us, for instance, to apply ARMC to verify safety properties of train controller systems [26], which required inference of predicates with both strict and nonstrict inequalities, and it allows us to verify examples that require predicates over up to four variables. Furthermore, our algorithm Inter LI (Q) provides a basis for dealing with linear arithmetic in the interpolation procedure CSIsat [1], which is integrated in Blast and has been successfully applied on software verification benchmarks.…”

Software Architecture of Modern Model Checkers

“…Finally, constraint programming techniques can be used for various validation tasks [23,24]. Similarly, in Horn-Clause Verification, SMT solvers are applied to Prolog or Datalog like specifications [12,58].…”