Patricia Bouyer  Home/Search
Context Related
| lsv.enscachan.fr/Pub...BouFMSD2004.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: lsv.enscachan....blisy3all.php (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it suffers from a state explosion and is thus not used in practice. Instead, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When we focus on forward analysis algorithms, the exact computation of all the successors of the initial... (Update)
Cited by: More
Model Checking Timed Automata with One or Two Clocks - Laroussinie, Markey.. (2004) (Correct)
Symbolic Model Checking of Simply-Timed Systems - Markey, Schnoebelen (2004) (Correct)
Similar documents (at the sentence level):
34.9%: Timed Automata May Cause Some Troubles - Bouyer (2002) (Correct)
8.8%: Updatable Timed Automata, an Algorithmic Approach - Bouyer (2001) (Correct)
Active bibliography (related documents): More All
2.1: Untamable Timed Automata! (Extended Abstract) - Bouyer (2003) (Correct)
1.6: Updatable Timed Automata - Bouyer, Dufourd, Fleury, Petit (2004) (Correct)
0.4: Static Guard Analysis in Timed Automata Verification - Behrmann, al. (2003) (Correct)
Similar documents based on text: More All
0.6: A New Algorithm to Decide Emptiness of Updatable Timed Automata - Bouyer (2000) (Correct)
0.5: Expressiveness of Updatable Timed Automata - Bouyer, Dufourd, Fleury, Petit (2000) (Correct)
0.5: Are Timed Automata Updatable? - Bouyer, Dufourd, Fleury, Petit (2000) (Correct)
Related documents from co-citation: More All
2: Real-time symbolic model checking for discrete time models - Campos, Clarke - 1995
2: Model Checking - Clarke, Grumberg et al. - 1994
BibTeX entry: (Update)
P. Bouyer. Forward analysis of updatable timed automata. Formal Methods in System Design, 24(3):281320, 2004. http://citeseer.ist.psu.edu/bouyer04forward.html More
@article{ bouyer04forward,
author = "P. Bouyer",
title = "Forward analysis of updatable timed automata",
journal = "Formal Methods in System Design",
volume = "24",
number = "3",
pages = "281--320",
year = "2004",
url = "citeseer.ist.psu.edu/bouyer04forward.html" }
Citations (may not include all citations):666 Theoretical Computer Science (context) - Alur, Dill et al. - 1994
184 Automata for Modeling Real-Time Systems (context) - Alur, Dill - 1990
141 Timing Assumptions and Verification of Finite-State Concurre.. (context) - Dill - 1989
94 CounterexampleGuided Abstraction Refinement - Clarke, Grumberg et al. - 2000
92 and Wang Yi (context) - Larsen, Pettersson - 1997
73 Timed Automata - Alur - 1999
57 Specifying Timed State Sequences in Powerful Decidable Logic.. - Wilke - 1994
54 Model-Checking Timed Automata - Yovine - 1998
52 Model-Checking of Real-Time Reachability Properties using Ab.. - Daws, Tripakis - 1998
46 andDoron Peled (context) - Clarke - 1999
40 A Determinizable Class of Timed Automata (context) - Alur, Fix et al. - 1994
36 The Observational Power of Clocks - Alur, Courcoubetis et al. - 1994
28 Are Timed Automata Updatable - Bouyer, Dufourd et al. - 2000
27 The Regular Real-Time Languages - Henzinger, Raskin et al. - 1998
23 Fly Symbolic Model-Checking for Real-Time Systems - Bouajjani, Tripakis et al. - 1997
21 Minimum-Cost Reachability for Priced Timed Automata - Behrmann, Fehnker et al. - 2001
21 Analysis of Timed Systems using Time-Abstracting Bisimulatio.. - Tripakis, Yovine - 2001
17 Controlled Timed Automata (context) - Demichelis, Zielonka - 1998
15 Expressiveness of Updatable Timed Automata - Bouyer, Dufourd et al. - 2000
14 cient Timed Reachability Analysis Using Clock Di#erence Diag.. (context) - Behrmann, Larsen et al. - 1999
9 Timed Automata with Periodic Clock Constraints (context) - Cho, Massimiliano - 2000
7 Verification of the Fast Reservation Protocol with Delayed T.. - Tripakis, Yovine - 1998
6 a Tool for Automatic Verification of Real-Time Systems (context) - Bengtsson, Larsson - 1996
6 Formal Modeling and Analysi AudioVideo Protocol Industrial C.. - Havelund, Kim et al. - 1997
6 Symbolic Approximations for Verifying Real-Time Systems (context) - Wong-Toi - 1994
6 DBMs ans States in Timed Systems (context) - Bengtsson - 2002
5 Characterization of the Expressive Power of Silent Transitio.. (context) - Brard, Diekert et al. - 1998
4 The Expressive Power of Clocks - Henzinger, Kopke et al. - 1995
4 L'analyse formelle des systmes temporiss en pratique (context) - Tripakis - 1998
4 and Sergio Yovine (context) - Daws, Olivero et al. - 1996
4 Analyse par simulation symbolique des systmes temporiss avec.. (context) - Daws - 1997
2 Automated Verification of a Parametric Real-Time Program: th.. (context) - Brard, Fribourg - 1999
2 A New Algorithm to Decide Emptiness of Updatable Timed Autom.. - Bouyer - 2000
1 A Model-Checker for Hybrid Systems (context) - Henzinger, Ho et al. - 1997
1 Analysing the PGM Protocol with U (context) - Brard, Bouyer et al. - 2002
1 Beyond Region Graphs: Symbolic Forward Analysis of Timed Aut.. (context) - Mukhopadhyay, Podelski - 1999
1 cient Algorithm for Minimizing Real-Time Transition Systems (context) - Yannakakis, Lee - 1997
Documents on the same site (http://www.lsv.ens-cachan.fr/Publis/publis-y3-all.php): More
Randomized Finite-State Distributed Algorithms As Markov Chains - Duflot, al. (2001) (Correct)
Verification of Embedded Reactive Fiffo Systems - Herbreteau, Cassez, Finkel, al. (2002) (Correct)
A Kleene/Büchi-like Theorem for Clock Languages - Bouyer, Petit (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC