@inbook{0cff525cbd434066bcf01619d335f60c,
title = "Timed vs. Time-triggered automata",
abstract = "To establish a semantic foundation for the synthesis of executable programs from timed models, we study in what sense the timed language (i.e. sequences of events with real-valued time-stamps) of a timed automaton is recognized by a digital machine. Based on the noninstant observability of events, we propose an alternative semantics for timed automata. We show that the new semantics gives rise to a natural notion of digitalization for timed languages. As a model for digital machines we use time-triggered automata - a subclass of timed automata with simplified syntax accepting digitalized timed languages. A time-triggered automaton is essentially a time table for a digital machine (or a digital controller), describing what the machine should do at a given time point, and it can be easily transformed to an executable program. Finally, we present a method to check whether a time-triggered automaton recognizes the language of a timed automaton according to the new semantics.",
author = "Pavel Kr{\v c}{\'a}l and Leonid Mokrushin and Thiagarajan, \{P. S.\} and Wang Yi",
year = "2004",
doi = "10.1007/978-3-540-28644-8\_22",
language = "英语",
isbn = "354022940X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "340--354",
editor = "Philippa Gardner and Nobuko Yoshida",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "德国",
}