921 search results - page 44 / 185 » On Interleaving in Timed Automata |
134
click to vote
ENTCS
2008
15 years 6 months ago
2008
Given a timed automaton with parametric timings, our objective is to describe a procedure for deriving constraints on the parametric timings in order to ensure that, for each valu...
185
click to vote
ICALP
1997
Springer
15 years 10 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...
178
click to vote
TACAS
2004
Springer
15 years 11 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...
158
click to vote
FM
2001
Springer
15 years 10 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...
202
click to vote
COCO
2010
Springer
15 years 10 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...