2632 search results - page 51 / 527 » Alternating Timed Automata |
137
Voted
ICALP
1997
Springer
15 years 5 months ago
1997
Springer
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
CONCUR
2006
Springer
15 years 5 months ago
2006
Springer
We propose a remedy to that part of the state-explosion problem for timed automata which is due to interleaving of actions. We prove the following quite surprising result: the unio...
123
click to vote
TACAS
2004
Springer
15 years 6 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...
104
click to vote
FM
2001
Springer
15 years 6 months ago
2001
Springer
To develop efficient algorithms for the reachability analysis of timed automata, a promising approach is to use binary decision diagrams (BDDs) as data structure for the representa...
140
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
—We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC1 = Log(CFL)) can be accepted by a symm...