512 search results - page 19 / 103 » Automata as Abstractions |
FORMATS
2010
Springer
14 years 12 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...
98
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights during any (nondeterministic) computation on t...
104
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. This paper studies the expressive power of finite-state automata recognizing sets of real numbers encoded positionally. It is known that the sets that are definable in th...
117
Voted
FOSSACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...