REDLIB for the Formal Verification of Embedded Systems

Abstract

To promote the technology of dense-time system modelchecking in both academia and industry, we developed a library, called REDLIB, which supports full TCTL modelchecking of dense-time automata with multiple fairness assumptions. REDLIB uses the BDD-like diagrams for the efficient representation and manipulation of dense-time statespaces. Users can use the procedures in REDLIB to quickly construct dense-time models and carry out basic Boolean and state-space operations, postcondtion/precondition calculation, state-space representation normalizations, greatest fixpoint calculation, parametric safety analysis of linear hybrid systems, speed-up techniques for greatest fixpoint evaluation, and coverage analysis of dense-time statespaces. REDLIB also has a preprocessor that allows for high-level constructs like arrays, message channels, dynamic memory allocation, procedure calls, and timers. In this article, we discuss the features of REDLIB and give small examples to show how to use REDLIB.

Planning in Real-Time Domains with Timed CTL Goals via Symbolic Model Checking

“…For implementing our symbolic realization, we used the open C library REDLIB [8], which offers multi-decision-& clock-restriction-diagrams (MDD+CRDs). The library offers logical formulas with discrete and real variables, the usual logical operators, variable quantifications, and the operator.…”

Model Checking Classes of Metric LTL Properties of Object-Oriented Real-Time Maude Specifications

“…There are several works determining decidable fragments of timed temporal logics (e.g., [7,23]) in order to support model checking algorithms for real-time systems. The tools KRONOS [27] and REDLIB [26] are two TCTL (timed CTL) model checkers for timed automata. The popular timed-automaton-based tool UPPAAL [5] provides model checking only for a "reachability subset" of TCTL that does not include bounded response or minimum separation.…”

Compositional Invariant Generation for Timed Systems

“…State-of-the-art tools [7,13,25,18] for the verification of such systems are mostly based on symbolic state space exploration, using efficient data structures and particularly involved exploration techniques. In the timed context, the use of compositional reasoning is inherently difficult due to the synchronous model of time.…”