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: | Nisho Doutilar |

Country: | Belarus |

Language: | English (Spanish) |

Genre: | Software |

Published (Last): | 5 May 2005 |

Pages: | 31 |

PDF File Size: | 20.50 Mb |

ePub File Size: | 15.97 Mb |

ISBN: | 814-4-70494-351-7 |

Downloads: | 40879 |

Price: | Free* [*Free Regsitration Required] |

Uploader: | Tygom |

During a run of a timed ttheory, clock values increase all with the same speed. In Theoretical Computer Science, vol. CamilleriGerardo Schneider J.

## There was a problem providing the content you requested

By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy PolicyTerms of Serviceand Dataset Qlur. Along the transitions of the automaton, clock values can be compared to integers.

Citation Statistics 6, Citations 0 ’93 ’98 ’04 ’10 ‘ A timed automaton accepts timed words-infinite sequences in which a real-valued time of occurrence is associated with each symbol. Retrieved from ” https: McMillanDavid L.

Semantic Scholar estimates that this publication has 6, citations based on the available data. 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.

Topics Discussed in This Paper. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks.

From This Paper Figures, tables, and topics from this paper. Timed automaton Search for additional papers on this topic. Extensions have been extensively studied, among them stopwatches, real-time tasks, cost functions, and timed games. C is a finite set called the clocks of A. Dill Published in Theor.

Methods for checking both safety and liveness properties have been developed and intensively studied over the last 20 years. BurchEdmund M. This page was last edited on 17 Decemberat CourcoubetisDavid L.

Modelling and analysis of normative documents John J. In automata theorya timed automaton is a finite automaton extended with a finite set of real-valued clocks.

Views Read Edit View history. By using this site, theiry agree to the Terms of Use and Privacy Policy. Dill REX Workshop Revisited Abdelaziz Fellah Skip to search form Skip to main content. Showing of zlur references. See our FAQ for additional information. References Publications referenced by this paper. Citations Publications citing this paper. Timed automata are a sub-class of a type hybrid automata. An edge qagrq’ from E is a transition from state q to q’ with action aguard g and clock resets r.

Requirement Universality probability Real-time clock Real-time transcription. From Wikipedia, the free encyclopedia.

Further, clocks can be reset. Formal language Muller automaton Nondeterministic algorithm Finite-state machine Real-time computing.

### A Theory of Timed Automata – Semantic Scholar

Dill, A theory of timed automata, Theoretical Computer Science ClarkeKenneth L. Extended Timed Alternating Finite Automata: The elements of Q are called the states of A.

Showing of 3, extracted citations. This paper has 6, citations. Q is a finite set. This paper has highly influenced other papers.

### CiteSeerX — A Theory of Timed Automata

Temporal Logic ofReal-time Systems Research. 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 diol of the automaton. These tools are becoming more and more mature, but are still all academic research tools.