Verification of Durational Action Timed Automata using UPPAAL

Abstract

The increasing complexity of software is incessant, this phenomenon is even more accentuated when temporal aspects are introduced, hence the need for rigorous verification methods.The main purpose of this paper is to propose a quantitative verification approach based on model checking. Their properties are expressed in TCTL (Timed Computation Tree Logic) on real-time systems. The system behavior is expressed by temporal labeled systems; namely Durational Action Timed Automata model (DATA* model). This model supports the expression of the parallel behavior, the temporal and structural non-atomicity of actions and urgency.Our approach is to interpret the behavior described by DATA* to Timed Safety Automata. The environment UPPAAL allows us verifying quantitative temporal properties, especially the bounded liveliness.

A Model-Based Toolchain to Verify Spatial Behavior of Cyber-Physical Systems

“…Duration Calculus (Chaochen, Hoare, & Ravn, 1991) and timed Durational Action Timed Automata (Guellati, Kitouni, & Saidouni, 2012) are two types of modal formalisms for time-critical systems. They are especially used for analyzing parallel behavior of systems featuring actions with an elapsing non-atomic time duration.…”

Time Petri Nets with Action Duration

“…Note that validation techniques can be applied directly on DATA structures using Aggregated Regions Automata . That is very important for the validation based on formal methods such as model checking using tools like UPPAAL and KRONOS (Larsen, Pettersson & Yi, 1997;Guellati, Kitouni & Saїdouni, 2012;Yovine, 1997), and model based testing . The use of DATA structure allows the verification of properties concerning parallel evolution of actions specified at state level of this model.…”