K.G.: Static guard analysis in timed automata verification. (2003)

by G Behrmann, P Bouyer, E Fleury, Larsen
Venue:Tools and Algorithms for the Construction and Analysis of Systems, LNCS,
Add To MetaCart
Results 1 - 10 of 26

Expressiveness of updatable timed automata

by Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit - Theoretical Computer Science , 2000
"... Abstract. We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking ..."
Abstract - Cited by 35 (11 self) - Add to MetaCart
Abstract. We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting decidable subclasses. In a surprising way, decidability depends on the nature of the clock constraints which are used, diagonal-free or not, whereas these constraints play identical roles in timed automata. We thus describe in a quite precise way the thin frontier between decidable and undecidable classes of updatable timed automata. We also study the expressive power of updatable timed automata. It turns out that any updatable automaton belonging to some decidable subclass can be effectively transformed into an equivalent timed automaton without updates but with silent transitions. The transformation suffers from an enormous combinatorics blow-up which seems unavoidable. Therefore, updatable timed automata appear to be a concise model for representing and analyzing large classes of timed systems. 1

Adding Symmetry Reduction to UPPAAL

by Martijn Hendriks, Gerd Behrmann, Kim Larsen, Peter Niebert, Frits Vaandrager , 2004
"... We describe a prototype extension of the Uppaal real-time model checking tool with symmetry reduction. The symmetric data type scalarset, which is also used in the Mur' model checker, was added to Uppaal's system description language to support the easy static detection of symmetries. O ..."
Abstract - Cited by 25 (4 self) - Add to MetaCart
We describe a prototype extension of the Uppaal real-time model checking tool with symmetry reduction. The symmetric data type scalarset, which is also used in the Mur' model checker, was added to Uppaal's system description language to support the easy static detection of symmetries. Our prototype tool uses state swaps, described and proven sound earlier by Hendriks, to reduce the space and memory consumption of Uppaal. Moreover, under certain assumptions the reduction strategy is canonical, which means that the symmetries are optimally used. For all examples that we experimented with (both academic toy examples and industrial cases), we obtained a drastic reduction of both computation time and memory usage, exponential in the size of the scalar sets used.
(Show Context)

To Store or Not to Store

by Gerd Behrmann, Kim G. Larsen - In CAV, volume 2725 of LNCS , 2003
"... Abstract. To limit the explosion problem encountered during reacha-bility analysis we suggest a variety of techniques for reducing the number of states to be stored during exploration, while maintaining the guarantee of termination and keeping the number of revisits small. The techniques include sta ..."
Abstract - Cited by 20 (7 self) - Add to MetaCart
Abstract. To limit the explosion problem encountered during reacha-bility analysis we suggest a variety of techniques for reducing the number of states to be stored during exploration, while maintaining the guarantee of termination and keeping the number of revisits small. The techniques include static analysis methods for component automata in order to de-termine small sets of covering transitions. We carry out extensive exper-imental investigation of the techniques within the real-time verication tool Uppaal. Our experimental results are extremely encouraging: a best combination is identied which for a variety of industrial case-studies re-duces the space-consumption to less than 10 % with only a moderate overhead in time-performance.
(Show Context)

Diagonal constraints in timed automata: Forward analysis of timed systems

by Patricia Bouyer, François Laroussinie, Pierre-alain Reynier - In Proc. FORMATS’05, vol. 3829 of LNCS , 2005
"... Abstract. Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability properties. Though diagonal constraints do not add expressive power to classical TA, the standard forward ana ..."
Abstract - Cited by 11 (3 self) - Add to MetaCart
Abstract. Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability properties. Though diagonal constraints do not add expressive power to classical TA, the standard forward analysis algorithm is not correct for this model. In this paper we survey several approaches to handle diagonal constraints and propose a refinement-based method for patching the usual algorithm: erroneous traces found by the classical algorithm are analyzed, and used for refining the model. 1

Lower and upper bounds in zone based abstractions of timed automata

by Gerd Behrmann, Patricia Bouyer, Kim G. Larsen, Radek Pelánek - IN: PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE ON TOOLS AND ALGORITHMS FOR CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS'04). VOLUME 2988 OF LNCS , 2004
"... Timed automata have an infinite semantics. For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared. We show that by distinguishing maximal lower and upper bounds, significantly coarser abstractions can be ..."
Abstract - Cited by 10 (2 self) - Add to MetaCart
Timed automata have an infinite semantics. For verification purposes, one usually uses zone based abstractions w.r.t. the maximal constants to which clocks of the timed automaton are compared. We show that by distinguishing maximal lower and upper bounds, significantly coarser abstractions can be obtained. We show soundness and completeness of the new abstractions w.r.t. reachability. We demonstrate how information about lower and upper bounds can be used to optimise the algorithm for bringing a difference bound matrix into normal form. Finally, we experimentally demonstrate that the new techniques dramatically increases the scalability of the real-time model checker Uppaal.
(Show Context)

Using non-convex approximations for efficient analysis of timed automata: Extended version

by F. Herbreteau, D. Kini, B. Srivathsan, I. Walukiewicz - arXiv – Computing Research Repository , 2011
"... Abstract. The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite. In order to make the graph finite, zones are appr ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
Abstract. The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite. In order to make the graph finite, zones are approximated using an extrapolation operator. For reasons of efficiency in current algorithms extrapolation of a zone is always a zone; and in particular it is convex. In this paper, we propose to solve the reachability problem without such extrapolation operators. To ensure termination, we provide an efficient algorithm to check if a zone is included in the so called region closure of another. Although theoretically better, closure cannot be used in the standard algorithm since a closure of a zone may not be convex. An additional benefit of the proposed approach is that it permits to calculate approximating parameters on-the-fly during exploration of the zone graph, as opposed to the current methods which do it by a static analysis of the automaton prior to the exploration. This allows for further improvements in the algorithm. Promising experimental results are presented. 1

Adding Invariants to Event Zone Automata

by Peter Niebert, Hongyang Qu
"... 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. Sy ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
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. 1
(Show Context)

A.: Timed automata with disjoint activity

by Bernd Westphal, Andreas Podelski - FORMATS 2012. LNCS , 2012
"... Abstract. The behavior of timed automata consists of idleness and ac-tivity, i.e. delay and action transitions. We study a class of timed au-tomata with periodic phases of activity. We show that, if the phases of activity of timed automata in a network are disjoint, then location reachability for th ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
Abstract. The behavior of timed automata consists of idleness and ac-tivity, i.e. delay and action transitions. We study a class of timed au-tomata with periodic phases of activity. We show that, if the phases of activity of timed automata in a network are disjoint, then location reachability for the network can be decided using a concatenation of timed automata. This reduces the complexity of verification in Uppaal-like tools from quadratic to linear time (in the number of components) while traversing the same reachable state space. We provide templates which imply, by construction, the applicability of sequential composition, a variant of concatenation, which reflects relevant reachability properties while removing an exponential number of states. Our approach covers the class of TDMA-based (Time Division Multiple Access) protocols, e.g. FlexRay and TTP. We have successfully applied our approach to an industrial TDMA-based protocol of a wireless fire alarm system with more than 100 sensors. 1
(Show Context)

Speeding Up Model Checking of Timed-Models by Combining Scenario Specialization and Live Component Analysis

by Víctor Braberman, Diego Garbervestky, Nicolás Kicillof, Daniel Monteverde, Alfredo Olivero - In FORMATS , 2009
"... Abstract. The common practice for verifying properties described as event occurrence patterns is to translate them into observer state machines. The resulting observer is then composed with (the components of) the system under analysis in order to verify a reachability property. Live Component Analy ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Abstract. The common practice for verifying properties described as event occurrence patterns is to translate them into observer state machines. The resulting observer is then composed with (the components of) the system under analysis in order to verify a reachability property. Live Component Analysis is a “cone of influence ” abstraction technique aiming at mitigating state explosion by detecting, at each observer location, which components are actually relevant for model checking purposes. Interestingly enough, the more locations the observer has, the more precise the relevance analysis becomes. This work proposes the formal underpinnings of a method to safely leverage this fact when properties are stated as event patterns (scenarios). That is, we present a sound and complete method of property manipulation based on specializing and complementing scenarios. The application of this method is illustrated on two case studies of distributed real-time system designs, showing dramatic improvements in the verification phase, even in situations where verification of the original scenario was unfeasible. 1
(Show Context)

Multi-core reachability for timed automata

by Andreas Dalsgaard, Alfons Laarman, Kim G. Larsen, Mads Chr Olesen, Jaco Van De Pol - In FORMATS, LNCS 7595 , 2012
"... Abstract. Model checking of timed automata is a widely used tech-nique. But in order to take advantage of modern hardware, the algo-rithms need to be parallelized. We present a multi-core reachability al-gorithm for the more general class of well-structured transition systems, and an implementation ..."
Abstract - Cited by 2 (2 self) - Add to MetaCart
Abstract. Model checking of timed automata is a widely used tech-nique. But in order to take advantage of modern hardware, the algo-rithms need to be parallelized. We present a multi-core reachability al-gorithm for the more general class of well-structured transition systems, and an implementation for timed automata. Our implementation extends the opaal tool to generate a timed automa-ton successor generator in c++, that is efficient enough to compete with the uppaal model checker, and can be used by the discrete model checker LTSmin, whose parallel reachability algorithms are now extended to han-dle subsumption of semi-symbolic states. The reuse of efficient lockless data structures guarantees high scalability and efficient memory use. With experiments we show that opaal+LTSmin can outperform the cur-rent state-of-the-art, uppaal. The added parallelism is shown to reduce verification times from minutes to mere seconds with speedups of up to 40 on a 48-core machine. Finally, strict BFS and (surprisingly) paral-lel DFS search order are shown to reduce the state count, and improve speedups. 1
(Show Context)