R. Alur, C. Courcoubetis, D. Dill, N. Halbwachs, H. Wong-Toi  Home/Search
Context Related
| upenn.edu/~alur/Rtss92W.ps.gz 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: upenn.edu/~alur/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This papers describes modifications to and the implementation of algorithms previously described in [1, 11]. We first describe three generic (untimed) algorithms for constructing graphs of the reachable states of a system, and how these graphs can be used for verification. They all have as input an implicit description of a transition system. We then apply these algorithms to real-time systems. The first algorithm performs a straightforward reachability analysis on sets of states of the system, ... (Update)
Context of citations to this paper: More
.... 0018 9340 02 17.00 2002 IEEE Verficiation Sessions in Comparison verify(G, 8, state graph G; int 8; number of processes G : G[1] x G[2] x. x G[S] check G against (a) verify(G, 8, c) Assrune we have reducers R, R. state graph G; int 8; number of...
...the initial mode. For our running example of 3 automata FMEP, the TCTL specification is as follows. verify all paths (henceforth not (mode(A[1]) M4) and (mode(A[2] M4) and not (mode(A[1] M4) and (mode(A[3] M4) and not (mode(A[2] M4) and (mode(A[3] M4) In the last part...
Cited by: More
Updatable Timed Automata - Bouyer, Dufourd, Fleury, Petit (2004) (Correct)
Reachability Analysis for Timed Automata Using.. - Pólrola, Penczek.. (2003) (Correct)
Verification of Timed Automata Based on Similarity - Dembinski, Penczek, Polrola (2002) (Correct)
Active bibliography (related documents): More All
0.2: Parametric Real-time Reasoning - Alur, Henzinger, Vardi (1993) (Correct)
0.1: A Theory of Timed Automata - Alur, Dill (1994) (Correct)
0.1: Minimization of Timed Transition Systems - Alur, Courcoubetis, Halbwachs (1992) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.2: Are Timed Automata Updatable? - Bouyer, Dufourd, Fleury, Petit (2000) (Correct)
0.1: Real-Time Verification Techniques for Untimed Systems - Du, Ramakrishnan, Smolka (Correct)
0.1: A New Algorithm to Decide Emptiness of Updatable Timed Automata - Bouyer (2000) (Correct)
Related documents from co-citation: More All
25: Symbolic model checking for realtime systems - Henzinger, Nicollin et al. - 1992
21: Timing assumptions and verification of finite-state concurrent systems (context) - Dill - 1989
20: Minimization of timed transition systems - Alur, Courcoubetis et al. - 1992
BibTeX entry: (Update)
Alur R, Courcoubetis C, Dill D, Halbwachs N, WongToi H, An Implementation of Three Algorithms for Timing Verification Based on Automata Emptiness, Proc 13 th RTSS, 1992, pp 157-166. http://citeseer.ist.psu.edu/alur92implementation.html More
@inproceedings{ alur92implementation,
author = "R. Alur and C. Courcoubetis and D. Dill and N. Halbwachs and H. Wong-Toi",
title = "An Implementation of three algorithms for timing verification based on automata emptiness",
booktitle = "Proceedings of the 13th {IEEE} Real-time Systems Symposium",
address = "Phoenix, Arizona",
pages = "157--166",
year = "1992",
url = "citeseer.ist.psu.edu/alur92implementation.html" }
Citations (may not include all citations):502 Concurrency and automata on infinite sequences (context) - Park - 1981
405 Depth-first search and linear graph algorithms (context) - Tarjan - 1972
404 Symbolic model checking for real-time systems - Henzinger, Nicollin et al. - 1992
299 Modelchecking for real-time systems (context) - Alur, Courcoubetis et al. - 1990
293 Hierarchical correctness proofs for distributed algorithms - Lynch, Tuttle - 1987
214 An old-fashioned recipe for real time - Abadi, Lamport - 1991
184 Automata for modeling real-time systems (context) - Alur, Dill - 1990
172 A really temporal logic - Alur, Henzinger - 1989
148 A fast mutual exclusion algorithm - Lamport - 1987
141 Timing assumptions and verification of finite-state concurre.. (context) - Dill - 1989
81 The complementation problem for buchi automata with applicat.. (context) - Sistla, Vardi et al. - 1987
75 Analysis of discrete event coordination (context) - Kurshan - 1990
72 Minimization of timed transition systems - Alur, Courcoubetis et al. - 1992
71 Techniques for Automatic Verification of Real-Time Systems (context) - Alur - 1991
69 Using mappings to prove timing properties - Lynch, Attiya - 1990
58 Online minimization of transition systems (context) - Lee, Yannakakis - 1992
55 Minimal model generation (context) - Bouajjani, Fernandez et al. - 1990
52 Specification and verification of concurrent programs by 8-a.. (context) - Manna, Pnueli - 1987
50 Minimum and maximum delay problems in real-time systems (context) - Courcoubetis, Yannakakis - 1990
43 Minimal state graph generation - Bouajjani, Fernandez et al. - 1992
38 A logic of concrete time intervals (context) - Lewis - 1990
37 Putting time into proof outlines - Schneider, Bloom et al. - 1991
23 Decidability of bisimulation equivalence for parallel timer .. (context) - Cerans - 1992
23 The control of dense realtime discrete event systems (context) - Wong-Toi, Hoffmann - 1991
13 Analyzing safety and fault tolerance using timed petri nets (context) - Leveson, Stolzy - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~alur/pub.html): More
Parametric Real-time Reasoning - Alur, Henzinger, Vardi (1993) (Correct)
Modularity for Timed and Hybrid Systems - Alur, Henzinger (1997) (Correct)
A Really Temporal Logic - Alur, Henzinger (1989) (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