scispace - formally typeset
Search or ask a question
Journal ArticleDOI

UPPAAL in a Nutshell

TL;DR: A detailed user guide is given which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior, to specify and verify its safety and bounded liveness properties in terms of its model.
Abstract: This paper presents the overal structure, the design criteria, and the main features of the tool box Uppaal. It gives a detailed user guide which describes how to use the various tools of Uppaal version 2.02 to construct abstract models of a real-time system, to simulate its dynamical behavior, to specify and verify its safety and bounded liveness properties in terms of its model. In addition, the paper also provides a short review on case-studies where Uppaal is applied, as well as references to its theoretical foundation.

Content maybe subject to copyright    Report

Citations
More filters
Book
07 Jan 1999

4,478 citations

Book ChapterDOI
14 Jul 2011
TL;DR: A major new release of the PRISMprobabilistic model checker is described, adding, in particular, quantitative verification of (priced) probabilistic timed automata.
Abstract: This paper describes a major new release of the PRISMprobabilistic model checker, adding, in particular, quantitative verification of (priced) probabilistic timed automata. These model systems exhibiting probabilistic, nondeterministic and real-time characteristics. In many application domains, all three aspects are essential; this includes, for example, embedded controllers in automotive or avionic systems, wireless communication protocols such as Bluetooth or Zigbee, and randomised security protocols. PRISM, which is open-source, also contains several new components that are of independent use. These include: an extensible toolkit for building, verifying and refining abstractions of probabilistic models; an explicit-state probabilistic model checking library; a discrete-event simulation engine for statistical model checking; support for generation of optimal adversaries/strategies; and a benchmark suite.

2,377 citations


Cites methods from "UPPAAL in a Nutshell"

  • ...For (non-probabilistic) timed automata, such methods are usually much less efficient than on-thefly zone-based reachability (as, e.g., in UPPAAL [13])....

    [...]

  • ...UPPAAL [13] is the leading verification tool for timed automata....

    [...]

  • ...A recent extension, UPPAAL-PRO [15], adds support for PTAs, but currently only analyses maximum probabilistic reachability properties....

    [...]

Book ChapterDOI
13 Sep 2004
TL;DR: This is a tutorial paper on the tool Uppaal to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool.
Abstract: This is a tutorial paper on the tool Uppaal. Its goal is to be a short introduction on the flavor of timed automata implemented in the tool, to present its interface, and to explain how to use the tool. The contribution of the paper is to provide reference examples and modeling patterns.

1,686 citations


Cites background from "UPPAAL in a Nutshell"

  • ...The first version of Uppaal was released in 1995 [45]....

    [...]

Journal ArticleDOI
11 Sep 2000
TL;DR: A verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing, and uses state compression to handle big states and partial order and symmetry reduction, slicing, abstraction, and runtime analysis techniques to reduce the state space.
Abstract: The majority of the work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it easier to experiment with mechanized formal methods such as theorem provers and model checkers. In this paper, we give arguments for why we believe it is time for the formal methods community to shift some of its attention towards the analysis of programs written in modern programming languages. In keeping with this philosophy, we have developed a verification and testing environment for Java, called Java PathFinder (JPF), which integrates model checking, program analysis and testing. Part of this work has consisted of building a new Java Virtual Machine that interprets Java bytecode. JPF uses state compression to handle large states, and partial order reduction, slicing, abstraction and run-time analysis techniques to reduce the state space. JPF has been applied to a real-time avionics operating system developed at Honeywell, illustrating an intricate error, and to a model of a spacecraft controller, illustrating the combination of abstraction, run-time analysis and slicing with model checking.

1,459 citations


Cites background from "UPPAAL in a Nutshell"

  • ...Typical examples are formal specification languages [40, 2, 39], purely logic based languages used in theorem provers [13, 33, 7], and guarded command languages used in model checkers [30, 29, 28]....

    [...]

Journal ArticleDOI
01 Jul 2000
TL;DR: It is shown that interesting classes of hybrid systems can be abstracted to purely discrete systems while preserving all properties that are definable in temporal logic.
Abstract: A hybrid system is a dynamical system with both discrete and continuous state changes. For analysis purposes, it is often useful to abstract a system in a way that preserves the properties being analysed while hiding the details that are of no interest. We show that interesting classes of hybrid systems can be abstracted to purely discrete systems while preserving all properties that are definable in temporal logic. The classes that permit discrete abstractions fall into two categories. Either the continuous dynamics must be restricted, as is the case for timed and rectangular hybrid systems, or the discrete dynamics must be restricted, as is the case for o-minimal hybrid systems. In this paper, we survey and unify results from both areas.

893 citations


Cites methods from "UPPAAL in a Nutshell"

  • ...We do not focus on complexity issues or the implementation of these algorithms by verification tools like KRONOS[24], COSPAN [8], UPAAL [48], and HYTECH [35]....

    [...]

  • ...We do not focus on complexity issues or the implementation of these algorithms by verification tools like K RONOS[24], COSPAN [8], UPAAL [48], and HYTECH [35]....

    [...]

References
More filters
Book
21 Oct 1957
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Abstract: From the Publisher: An introduction to the mathematical theory of multistage decision processes, this text takes a functional equation approach to the discovery of optimum policies. Written by a leading developer of such policies, it presents a series of methods, uniqueness and existence theorems, and examples for solving the relevant equations. The text examines existence and uniqueness theorems, the optimal inventory equation, bottleneck problems in multistage production processes, a new formalism in the calculus of variation, strategies behind multistage games, and Markovian decision processes. Each chapter concludes with a problem set that Eric V. Denardo of Yale University, in his informative new introduction, calls a rich lode of applications and research topics. 1957 edition. 37 figures.

14,187 citations

Book
01 Jan 1989
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Abstract: Foreword. 1. Modelling Communication. 2. Basic Definitions. 3. Equational laws and Their Application. 4. Strong Bisimulation and Strong Equivalence. 5. Bisimulation and Observation Equivalence. 6. Further Examples. 7. The Theory of Observation Congruence. 8. Defining a Programming Language. 9. Operators and Calculi. 10. Specifications and Logic. 11. Determinancy and Confluence. 12. Sources and Related Work. Bibliography. Index.

8,625 citations


"UPPAAL in a Nutshell" refers background in this paper

  • ...As this requires synchronization between three processes this can not directly be expressed in Uppaal where synchronization, as in CCS, is between two processes based on complementarity of actions....

    [...]

  • ...Absence of synchronization action indicates an internal (non{synchronizing) edge similar to {transitions in CCS....

    [...]

  • ...As in CCS [30] communication on channels occur as two{process synchronizations....

    [...]

Book ChapterDOI
01 Jul 1990
TL;DR: To model the behavior of finite-state asynchronous real-time systems, the notion of timed Buchi automata (TBA) is proposed, coupled with a mechanism to express constant bounds on the timing delays between system events.
Abstract: To model the behavior of finite-state asynchronous real-time systems we propose the notion of timed Buchi automata (TBA). TBAs are Buchi automata coupled with a mechanism to express constant bounds on the timing delays between system events. These automata accept languages of timed traces, traces in which each event has an associated real-valued time of occurrence.

890 citations


Additional excerpts

  • ...The basis of the Uppaal model is the notion of timed automata [2] developed by Alur and Dill as an extension of classical finite-state automata with clock variables....

    [...]

Book ChapterDOI
12 Jun 1989
TL;DR: A scheme that allows timing assumptions to be incorporated into automatic proofs of arbitrary finite-state temporal properties is described, and it is conjecture that the method presented can be extended in this way.
Abstract: We have described a scheme that allows timing assumptions to be incorporated into automatic proofs of arbitrary finite-state temporal properties. The obvious extension is to be able to prove timing properties, not just assume them. This would provide a verification framework for finite-state hard real-time systems. We conjecture that the method presented can, in fact, be extended in this way.

812 citations


"UPPAAL in a Nutshell" refers background or methods in this paper

  • ...One such well-known data structure is that of Di erence Bounded Matrices [4, 16, 33], Dbm, which o ers a canonical representation for constraint systems....

    [...]

  • ...4 Optimizations ADbm representation is in fact a weighted directed graph where the vertices correspond to clocks (including a zeroclock) and the weights on the edges stand for the bounds on the di erences between pairs of clocks [4, 16, 33]....

    [...]

Journal Article
TL;DR: Uppaal as mentioned in this paper is a tool suite for automatic verification of safety and bounded liveness properties of real-time systems modeled as networks of timed automata, which includes a graphical interface that supports graphical and textual representations of networks of automata and automatic transformation from graphical representations to textual format.
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.

810 citations