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: Nikogore Kazinris
Country: Mauritius
Language: English (Spanish)
Genre: Politics
Published (Last): 11 March 2013
Pages: 111
PDF File Size: 9.37 Mb
ePub File Size: 13.31 Mb
ISBN: 582-4-53345-356-6
Downloads: 74376
Price: Free* [*Free Regsitration Required]
Uploader: Mikagore

An edge qagr gheory, q’ from E is a transition from state q to q’ with action aguard g and clock resets r.

This paper has 6, citations. References Publications referenced by this paper. From Wikipedia, the free encyclopedia. Formal language Muller automaton Nondeterministic algorithm Finite-state machine Real-time computing. From This Paper Figures, tables, and topics from this paper. See our FAQ for additional information. McMillanDavid L.

A Theory of Timed Automata – Semantic Scholar

Showing of 3, extracted citations. Requirement Universality probability Real-time clock Real-time transcription. Extensions have been extensively studied, among them stopwatches, real-time tasks, xlur functions, and timed games.


Timed automata are a sub-class of a type hybrid automata. Topics Discussed in This Paper.

Timed automaton

Revisited Abdelaziz Fellah Timed automata can be used to model and analyse the timing behavior of computer systems, e. Skip to alru form Skip to main content. Timed automaton Search for additional papers on this topic. 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.

Dill Published in Theor. Q is a finite set.

CiteSeerX — A Theory of Timed Automata

By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. In automata theorya timed automaton is a finite automaton extended with a finite set of real-valued clocks. Along the transitions of the automaton, clock values can be compared to integers. Modelling and analysis of normative documents John J.

This paper has highly influenced other papers. In Theoretical Computer Science, vol. Further, clocks can be reset.

Citations Publications citing this paper. These comparisons form guards that may enable or disable transitions and by doing so constrain the possible behaviors of the automaton. C is a finite set called the clocks of A.


There was a problem providing the content you requested

Extended Timed Alternating Finite Automata: Showing of 26 references. A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol. Dill, A theory of timed automata, Theoretical Computer Science CamilleriGerardo Schneider J.

Citation Statistics 6, Citations 0 ’93 ’98 ’04 ’10 ‘ Temporal Logic ofReal-time Systems Research. Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years. These tools are becoming more and more mature, but are still all academic research tools.

By using this site, you agree to the Terms of Use dull Privacy Policy.