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: Kajikus Dor
Country: Cape Verde
Language: English (Spanish)
Genre: Literature
Published (Last): 20 April 2010
Pages: 52
PDF File Size: 1.47 Mb
ePub File Size: 4.33 Mb
ISBN: 370-1-95020-713-7
Downloads: 61985
Price: Free* [*Free Regsitration Required]
Uploader: Memi

Modelling and analysis of normative documents John J. This paper has 6, citations. Extensions have been extensively studied, among them stopwatches, real-time od, cost functions, and timed games.

Requirement Universality probability Real-time clock Real-time transcription. Q is a finite set. By using this site, autommata agree to the Terms of Use and Privacy Policy. Timed automata are a sub-class of a type hybrid automata. Timed automaton Search for additional papers on this topic. Dill, A theory of timed automata, Theoretical Computer Science In Theoretical Computer Science, vol. Showing of 26 references. Views Read Edit View history.

Skip to search form Skip to main content. Dill Published in Theor. References Publications referenced by this paper. CamilleriGerardo Schneider J. It or been shown that the state reachability problem for timed automata is decidable, [1] which aalur this an interesting sub-class of hybrid automata.


By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License.

There was a problem providing the content you requested

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. Our definition provides a simple, and yet powerful, theoty to annotate state-transition graphs with timing constraints using finitely many real-valued clocks.

In automata theorya timed automaton is a finite automaton extended with a finite set of real-valued clocks. Showing of 3, extracted citations. Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years.

Further, clocks can be reset. McMillanDavid L. Revisited Abdelaziz Fellah Along the transitions of the automaton, clock values can theorh compared to integers.

A Theory of Timed Automata – Semantic Scholar

Formal language Muller automaton Nondeterministic algorithm Finite-state machine Real-time computing. Extended Timed Alternating Finite Automata: Citation Statistics 6, Citations 0 ’93 ’98 ’04 ’10 ‘ From Wikipedia, the free encyclopedia. Topics Discussed in This Paper. CourcoubetisDavid L. During a run of a timed automaton, clock values increase all with the same speed. Semantic Scholar estimates that this publication has 6, citations based on the available data.


ClarkeKenneth L. This paper has highly influenced other papers. From This Paper Figures, tables, and topics from this paper. Dill REX Workshop See our FAQ for additional information.

The elements of Q are called the states of A. These tools are becoming more and more mature, but are still all academic research tools.

Timed automaton

BurchEdmund M. Citations Publications citing this paper.

Timed automata can be used to model and analyse the timing behavior of computer systems, e. Retrieved from ” https: A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol.

Author: admin