114 search results - page 11 / 23 » A Determinizable Class of Timed Automata |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
SDL
2001
13 years 9 months ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...
MFCS
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...
TACAS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...