scholarly journals UPPAAL in 1995

1996 ◽  
Vol 3 (60) ◽  
Author(s):  
Johan Bengtsson ◽  
Kim G. Larsen ◽  
Fredrik Larsson ◽  
Paul Pettersson ◽  
Wang Yi
Keyword(s):  
Real Time ◽  
Case Studies ◽  
Theoretical Foundation ◽  
Timed Automata ◽  
Automatic Verification ◽  
Real Time Systems ◽  
The Past ◽  
Liveness Properties ◽  
Time Systems

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

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

1996 ◽  
Vol 3 (58) ◽  
Author(s):  
Johan Bengtsson ◽  
Kim G. Larsen ◽  
Fredrik Larsson ◽  
Paul Pettersson ◽  
Wang Yi
Keyword(s):  
Real Time ◽  
Timed Automata ◽  
Automatic Verification ◽  
Graphical Interface ◽  
Real Time Systems ◽  
Model Checker ◽  
Current Version ◽  
Textual Representations ◽  
Liveness Properties ◽  
Time Systems

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

scholarly journals Diagnostic Model Checking for Real-Time Systems

1996 ◽  
Vol 3 (57) ◽  
Author(s):  
Kim G. Larsen ◽  
Paul Pettersson ◽  
Wang Yi
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Timed Automata ◽  
Automatic Verification ◽  
Diagnostic Feature ◽  
Diagnostic Model ◽  
Graphical Interface ◽  
Real Time Systems ◽  
Control Protocol ◽  
Time Systems

Uppaal is a new tool suit for automatic verification of networks of<br />timed automata. In this paper we describe the diagnostic model-checking feature<br />of Uppaal and illustrates its usefulness through the debugging of (a version<br />of) the Philips Audio-Control Protocol. Together with a graphical interface of<br />Uppaal this diagnostic feature allows for a number of errors to be more easily<br />detected and corrected.

scholarly journals Predicate Abstraction for Dense Real-Time Systems

2001 ◽  
Vol 8 (44) ◽  
Author(s):  
M. Oliver Möller ◽  
Harald Ruess ◽  
Maria Sorea
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Timed Automata ◽  
Finite Sequence ◽  
Finite Basis ◽  
Predicate Abstraction ◽  
Real Time Systems ◽  
Liveness Properties ◽  
Small Set ◽  
Time Systems

We propose predicate abstraction as a means for verifying a rich class of safety and liveness properties for dense real-time systems. First, we define a restricted semantics of timed systems which is observationally equivalent to the standard semantics in that it validates the same set of mu-calculus formulas without a next-step operator. Then, we recast the model checking problem S |= phi for a timed automaton S and a mu-calculus formula phi in terms of predicate abstraction. Whenever a set of abstraction predicates forms a so-called <em>basis</em>, the resulting abstraction is strongly preserving in the sense that S validates phi iff the corresponding finite abstraction validates this formula phi. Now, the abstracted system can be checked using familiar mu-calculus model checking.<br /> <br />Like the region graph construction for timed automata, the predicate abstraction algorithm for timed automata usually is prohibitively expensive. In many cases it suffices to compute an approximation of a finite bisimulation by using only a subset of the basis of abstraction predicates. Starting with some coarse abstraction, we define a finite sequence of refined abstractions that converges to a strongly preserving abstraction. In each step, new abstraction predicates are selected nondeterministically from a finite basis. Counterexamples from failed mu-calculus model checking attempts can be used to heuristically choose a small set of new abstraction predicates for refining the abstraction.

MODELING AND ANALYSIS OF REAL-TIME SYSTEMS WITH MUTEX COMPONENTS

2012 ◽  
Vol 23 (04) ◽  
pp. 831-851 ◽  
Author(s):  
GUOQIANG LI ◽  
XIAOJUAN CAI ◽  
SHOJI YUEN
Keyword(s):  
Real Time ◽  
Timed Automata ◽  
Expressive Power ◽  
Behavioral Model ◽  
Parallel Composition ◽  
Real Time Systems ◽  
Modeling And Analysis ◽  
Compositional System ◽  
Time Systems ◽  
Timed Automaton

Timed automata are commonly recognized as a formal behavioral model for real-time systems. For compositional system design, parallel composition of timed automata as proposed by Larsen et al. [22] is useful. Although parallel composition provides a general method for system construction, in the low level behavior, components often behave sequentially by passing control via communication. This paper proposes a behavioral model, named controller automata, to combine timed automata by focusing on the control passing between components. In a controller automaton, to each state a timed automaton is assigned. A timed automaton at a state may be preempted by the control passing to another state by a global labeled transition. A controller automaton properly extends the expressive power because of the stack, but this can make the reachability problem undecidable. Given a strict partial order over states, we show that this problem can be avoided and a controller automaton can be faithfully translated into a timed automaton.

scholarly journals Online On-the-Fly Testing of Real-time Systems

2003 ◽  
Vol 10 (49) ◽  
Author(s):  
Marius Mikucionis ◽  
Kim G. Larsen ◽  
Brian Nielsen
Keyword(s):  
Real Time ◽  
Test Generation ◽  
Timed Automata ◽  
Online Testing ◽  
Real Time Systems ◽  
Model Checker ◽  
Test Specification ◽  
And Performance ◽  
Automata Network ◽  
Time Systems

In this paper we present a framework, an algorithm and a new tool for online testing of real-time systems based on symbolic techniques used in UPPAAL model checker. We extend UPPAAL timed automata network model to a test specification which is used to generate test primitives and to check the correctness of system responses including the timing aspects. We use timed trace inclusion as a conformance relation between system and specification to draw a test verdict. The test generation and execution algorithm is implemented as an extension to UPPAAL and experiments carried out to examine the correctness and performance of the tool. The experiment results are promising.

scholarly journals Time Petri Nets with Action Duration

2013 ◽  
Vol 4 (2) ◽  
pp. 62-83 ◽  
Author(s):  
N. Belala ◽  
D.E. Saїdouni ◽  
R. Boukharrou ◽  
A.C. Chaouche ◽  
A. Seraoui ◽  
...  
Keyword(s):  
Petri Nets ◽  
Real Time ◽  
Timed Automata ◽  
Operational Semantics ◽  
Time Interval ◽  
Timing Constraints ◽  
Time Petri Nets ◽  
Real Time Systems ◽  
High Level ◽  
Time Systems

The design of real-time systems needs a high-level specification model supporting at the same time timing constraints and actions duration. The authors introduce in this paper an extension of Petri Nets called Time Petri Nets with Action Duration (DTPN) where time is associated with transitions. In DTPN, the firing of transitions is bound to a time interval and transitions represent actions which have explicit durations. The authors give an operational semantics for DTPN in terms of Durational Action Timed Automata (DATA). DTPN considers both timing constraints and durations under a true-concurrency semantics with an aim of better expressing concurrent and parallel behaviours of real-time systems.

Sign in / Sign up

Export Citation Format

Share Document