942 search results - page 17 / 189 » Interrupt Timed Automata |
118
Voted
IPPS
2006
IEEE
15 years 7 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...
115
Voted
FORMATS
2008
Springer
15 years 3 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...
108
Voted
CORR
2011
Springer
14 years 8 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...
127
click to vote
RTSS
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents the design of user-level scheduling hierarchies in the Composite component-based system. The motivation for this is centered around the design of a system that...
106
Voted
ICTAC
2009
Springer
15 years 8 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...