3229 search results - page 20 / 646 » The Theory of Timed Automata |
FORMATS
2007
Springer
14 years 2 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
We show that timed automata can be used to model and to analyze timeliness properties of embedded system architectures. Using a case study inspired by industrial practice, we pres...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
ICTAC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...