UPPAAL—a Tool Suite for Automatic Verification of Real–Time Systems

Abstract

Abstract. Uppaal is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata. It includes: a graphical interface that supports graphical and textual representations of networks of timed automata, and automatic transformation from graphical representations to textual format, a compiler that transforms a certain class of linear hybrid systems to networks of timed automata, and a model-checker which is implemented based on constraint-solving techniques. Uppaal also supports diagnostic model-checking providing diagnostic information in case verification of a particular real-time systems fails. The current version of Uppaal is available on the World Wide Web via the Uppaal home page

Uppaal in 1995

“…For detailed descriptions of the model, we refer to [9,4]. The model checking algorithms implemented in UPPAAL are developed in [12,9].…”

“…the Manufacturing Plant [6], synchronization on certain channels should happen immediately. For this reason the UPPAAL model was extended with urgent channels, on which processes should synchronize whenever possible [4]. The notion of urgent channels (also known as urgent actions [7], a Manufacturing Plant [6], a Mine-Pump Controller [8] and a Water Tank [11].…”

“…UPPAAL is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata extended with data variables [12,9,4], developed during the past two years. In this paper, we summarize the features of UPPAAL in particular the various extensions developed in 1995 as well as applications to various case-studies, review and provide pointers to the theoretical foundation.…”

The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation

“…At the same time, the TAD model ensures, under reasonable assumption, what is called time reactivity in [6] and time lock freedom in [8], that is, whenever time progress stops there exists at least one transition enabled. This model is nowadays embedded in modelling languages such as IF [10] and MoDeST [15], and urgent transitions in Uppaal [4] can be seen as a particular instance of TAD transitions.…”

Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets

“…Few of them are really efficient. They usually implement translations into timed automata, which permits to reuse model checkers such as [4,5]. Petri nets verification tools may be considered as well.…”