1246 search results - page 19 / 250 » Recursive Timed Automata |
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...
FORMATS
2004
Springer
14 years 24 days ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
AC
2003
Springer
14 years 19 days ago
2003
Springer
This chapter is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We prese...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
FORMATS
2005
Springer
14 years 28 days ago
2005
Springer
This paper attempts to improve our understanding of timed languages and their relation to timed automata. We start by giving a constructive proof of the folk theorem stating that t...