1355 search results - page 9 / 271 » Alternating Timed Automata over Bounded Time |
ICFEM
2009
Springer
13 years 5 months ago
2009
Springer
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
Timed automata has been used as a powerful formalism for specifying, designing, and analyzing real time systems. We consider the generalization of timed automata to Pushdown Timed ...
COCO
2003
Springer
14 years 23 days ago
2003
Springer
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1}l → {0, 1} ...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper is concerned with the language inclusion problem for timed automata: given timed automata A and B, is every word accepted by B also accepted by A? Alur and Dil...
WIA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...