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: Shaktikus Mezilrajas
Country: Burkina Faso
Language: English (Spanish)
Genre: Technology
Published (Last): 7 April 2017
Pages: 58
PDF File Size: 10.46 Mb
ePub File Size: 1.70 Mb
ISBN: 831-2-35481-747-3
Downloads: 44979
Price: Free* [*Free Regsitration Required]
Uploader: Fenrim

A Theory of Timed Automata – Semantic Scholar

See our FAQ for additional information. Revisited Abdelaziz Fellah Automatq REX Workshop By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset License. These tools are becoming more and more mature, but are still all academic research tools.

It has been automta that the state reachability problem for timed automata is decidable, [1] which makes this an interesting sub-class of hybrid automata. An edge qagrq’ from E is a transition from state q to q’ with action aguard g and clock resets r.


Further, clocks can be reset.

Alur/Dill: A Theory of Timed Automata

Semantic Scholar estimates that this publication has 6, citations based on the available data. By using this site, you agree to the Terms of Use and Privacy Policy. C is a finite set called the clocks of A. Modelling and analysis of normative documents John J.

Timed automaton

Methods for checking both safety and liveness properties have been rill and intensively studied over the last 20 years. References Publications referenced by this paper. 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.

Temporal Logic ofReal-time Systems Research. BurchEdmund M. CamilleriGerardo Schneider J. CourcoubetisDavid L. Showing of 3, extracted citations. Dill Published in Aitomata.

Topics Discussed in This Paper. Formal language Muller automaton Nondeterministic algorithm Finite-state machine Real-time computing.

Timed automata are a sub-class of a type hybrid automata. In Theoretical Computer Science, vol. Requirement Universality probability Real-time clock Real-time transcription. Retrieved from ” https: A timed automaton accepts timed words-infinite sequences automxta which a real-valued time of occurrence is associated with each symbol. This paper has highly influenced other papers. This paper has 6, citations. ClarkeKenneth L. This page was last edited on 17 Decemberdjll From Wikipedia, the free encyclopedia.


The elements of Q are called the states of A.