Parking Can Get You There Faster - Model Augmentation to Speed up Real-Time Model Checking

We present an approximation technique that can render real-time model checking of safety and universal path properties more e#cient. It is beneficial, when loops lead to repetition of control situations. Basically we augment a timed automata model with carefully selected extra transitions. This increases the size of the state-space, but potentially decreases the number of symbolic states to be explored by orders of magnitude. We give a formal definition of a timed automata formalism, enriched with basic data types, hand-shake synchronization, urgency, and committed locations. We prove by means of a trace semantics that if a safety property can be established in the augmented model, it also holds for the original model. We extend our technique to a richer set of properties that can be decided via a set of traces (universal path properties). In order for universal path properties to carry over to the original model, the semantics of the timed automata formalism is formulated relative to the applied augmentation. Our technique is particularly useful in systems, where a scheduler dictates repetition of control over elapsing time. As a typical example we mention translations of LEGO RCX programs to Uppaal models, where the Round-Robin scheduler is a static entity. We allow scheduler and associated tasks to "park" until some timing or environmental conditions are met. We apply our technique on a bricks sorter model for a safety property and report run-time data