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: Zulkilmaran Vudojora
Country: Ghana
Language: English (Spanish)
Genre: Science
Published (Last): 17 August 2017
Pages: 31
PDF File Size: 17.9 Mb
ePub File Size: 2.36 Mb
ISBN: 222-5-43452-763-2
Downloads: 70561
Price: Free* [*Free Regsitration Required]
Uploader: Zurg

Further, clocks can be reset. 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. Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years. Topics Discussed in This Paper. Timed automata are a sub-class of a type hybrid automata.

See our FAQ for additional information. The elements of Q are called the states of A. ClarkeKenneth L. Extended Timed Alternating Finite Automata: CourcoubetisDavid L. In Theoretical Computer Science, vol. Dill, A theory of timed automata, Theoretical Computer Science Formal language Muller automaton Nondeterministic tmied Finite-state machine Real-time computing. This paper has highly influenced other papers. These tools are becoming more and more mature, but are still all academic research tools.


This paper has 6, citations. Skip to search form Skip to main content. Showing of 26 references. By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

CiteSeerX — A Theory of Timed Automata

Extensions have been extensively studied, among them stopwatches, real-time tasks, cost functions, and timed games. Showing of 3, extracted citations. Wlur definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many s clocks.

Along the transitions of the automaton, clock values can be compared to integers. Timed automata can be used to model and analyse the timing behavior of computer systems, e. Revisited Abdelaziz Fellah References Publications referenced by this paper.

There was a problem providing the content you requested

Citations Publications citing this paper. Semantic Scholar estimates that this publication has 6, citations based on the available data. Retrieved from ” https: A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol.

Timed automaton Search for additional papers on this topic. Views Read Edit View history. Modelling and analysis of normative documents John J. From Wikipedia, the free encyclopedia.


From This Paper Figures, tables, and topics from this paper.

A Theory of Timed Automata – Semantic Scholar

CamilleriGerardo Schneider J. BurchEdmund M. Citation Statistics 6, Citations 0 ’93 ’98 ’04 ’10 ‘ McMillanDavid L. C is a finite set called the clocks of A.

In automata theorya timed automaton is a aa automaton extended with a finite set of real-valued clocks. Requirement Universality probability Real-time clock Real-time transcription. Dill Published in Theor.

During a run of a timed automaton, clock values increase all with the same speed. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. Temporal Logic ofReal-time Systems Research. By using this site, you agree to the Terms of Use and Privacy Policy. Q is a finite set.