101 search results - page 4 / 21 » When Are Timed Automata Determinizable |
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
WIA
2009
Springer
14 years 5 days ago
2009
Springer
In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft’s algorithm. Hopcroft’s algorithm has several degrees o...
LICS
2003
IEEE
14 years 27 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
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...
TSMC
2002
13 years 7 months ago
2002
Due to its fixed assignment nature, the well-known time division multiple access (TDMA) protocol suffers from poor performance when the offered traffic is bursty. In this paper, an...