Cătălin Dima, Dynamical properties of timed automata revisited, . Rajeev Alur, Thao Dang, Franjo Ivančić, Predicate abstraction for. BibTeX. @ARTICLE{Alur94atheory, author = {Rajeev Alur and David L. Dill}, title = {A Theory of Timed Automata}, journal = {Theoretical Computer Science}. The Theory of Alur-Dill Timed Automata. Ashutosh Trivedi. Department of Computer Science and Engineering,. IIT Bombay. CS New.

Author: Meztiran Shashura
Country: Andorra
Language: English (Spanish)
Genre: Medical
Published (Last): 4 December 2005
Pages: 409
PDF File Size: 12.29 Mb
ePub File Size: 2.65 Mb
ISBN: 306-3-68274-754-9
Downloads: 90182
Price: Free* [*Free Regsitration Required]
Uploader: Dak

Timed automata are a sub-class of a type hybrid automata. Citations Publications citing this paper. In automata theorytheoru timed automaton is a finite automaton extended with a finite set of real-valued clocks. Temporal Logic ofReal-time Systems Research.

References Publications referenced by this paper. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

Citation Statistics 6, Citations 0 ’93 ’98 ’04 ’10 ‘ Timed automaton Search for additional papers on this topic. McMillanDavid L.

CiteSeerX — A Theory of Timed Automata

A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol. Dill REX Workshop Requirement Universality probability Real-time clock Real-time transcription.


This page was last edited on 17 Decemberat See our FAQ for additional information. From Wikipedia, the free encyclopedia. During a run of a timed automaton, clock values increase all with tyeory same speed. Views Read Edit View history.

Timed automaton

From This Paper Figures, tables, and topics from this paper. Topics Discussed in This Paper. Skip to search form Skip to main content. Our thheory provides a simple, timec yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. C is a finite set called the clocks of A.

It has been shown that the state reachability problem for timed automata is decidable, [1] which makes this an interesting sub-class of hybrid automata.

Semantic Scholar estimates that this publication has 6, citations based on the available data.

Timed automaton – Wikipedia

Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years. Modelling and analysis of normative alu John J. Further, clocks can be reset.


Timed automata can be used to model and analyse the timing behavior of computer systems, e. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. This paper has highly influenced other papers. Showing of 26 references.

Extended Timed Alternating Finite Automata: Revisited Abdelaziz Fellah Dill, A theory of timed automata, Theoretical Computer Science The elements of Q are called the states of A. ClarkeKenneth L. Q is a finite set. Extensions have been extensively studied, among aluf stopwatches, real-time tasks, cost functions, and timed games.

A Theory of Timed Automata

Dill Published in Theor. An edge qagrq’ from E is a transition from state q to q’ with action aguard g and clock resets r. CamilleriGerardo Schneider J.

In Theoretical Computer Science, vol. BurchEdmund M. Retrieved from ” https: