Model-checking for real-time systems

Larsen, Kim Guldstrand; Pettersson, Paul; Yi, Wang

doi:10.1007/3-540-60249-6_41

Cited by 154 publications

(67 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Because Uppaal does not provide the number of visited states, path depth, etc., only its execution time is given here. The Fischer protocol uses timing constraints and a shared variable to ensure mutual exclusion among processes competing for access to a critical section [13]. Table 1 contains the results for checking mutual exclusion (a safety property) on a buggy version of the protocol.…”

Section: Resultsmentioning

confidence: 99%

Deep Random Search for Efficient Model Checking of Timed Automata

Grosu

Huang

Smolka

et al. 2008

Composition of Embedded Systems. Scientific and Industrial Issues

View full text Add to dashboard Cite

Abstract. We present DRS (Deep Random Search), a new Las Vegas algorithm for model checking safety properties of timed automata. DRS explores the state space of the simulation graph of a timed automaton by performing random walks up to a prescribed depth. Nodes along these walks are then used to construct a random fringe, which is the starting point of additional deep random walks. The DRS algorithm is complete, and optimal to within a specified depth increment. Experimental results show that it is able to find extremely deep counter-examples for a number of benchmarks, outperforming Open-Kronos and Uppaal in the process.

show abstract

Section: Resultsmentioning

confidence: 99%

Deep Random Search for Efficient Model Checking of Timed Automata

Grosu

Huang

Smolka

et al. 2008

Composition of Embedded Systems. Scientific and Industrial Issues

View full text Add to dashboard Cite

show abstract

“…Then B(C) is the set of formulas that are conjunctions of atomic constraints of the form c n and c − d m for all c, d ∈ C, ∈ {≤, <, =, >, ≥}, n ∈ N and m ∈ Z. Elements of B(C) are called guards over C and 2 C denotes the power set of C. We adopt the definition of a timed automaton from [13].…”

Section: Timed Automatamentioning

confidence: 99%

Multi-robot planning : a timed automata approach

Quottrup

Bak

Zamanabadi

2004

IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004

View full text Add to dashboard Cite

Abstract-This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feedback controllers obeying simple restriction on a planar grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research.

show abstract

“…While the theory, algorithms [9,10] and tools [12,3] for timed automata represent a considerable achievement (and indeed impressing industrial applications have been treated), the combinatorial explosion particular to this kind of modeling and analysis -sometimes referred to as "clock explosion" (at the same time similar to and different from classical "state explosion") -remains a challenge for research and practice. Despite the theoretical limits (for a PSPACE complete problem), great effort has been invested into the optimization of the symbolic approach (see e.g.…”

Section: Introductionmentioning

confidence: 99%

Adding Invariants to Event Zone Automata

Niebert

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event occurrences instead of clock zones that use vectors of clock values grouped in polyhedral clock constraints. Symbolic state exploration with event zones rather than clock zones can result in significant reductions in the number of symbolic states explored. In this work, we show how to extend the event zone approach to networks of automata with local state invariants, an important feature for modeling complex timed systems. To avoid formalizing local states, we attach to each transition an urgency constraint, that allows to code local state invariants. We have integrated the extension into a prototype tool with event zones and reported very promising experimental results.

show abstract

Model-checking for real-time systems

Cited by 154 publications

References 53 publications

Deep Random Search for Efficient Model Checking of Timed Automata

Deep Random Search for Efficient Model Checking of Timed Automata

Multi-robot planning : a timed automata approach

Adding Invariants to Event Zone Automata

Contact Info

Product

Resources

About