942 search results - page 95 / 189 » Interrupt Timed Automata |
TSMC
2002
13 years 8 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...
ESOP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
FORMATS
2004
Springer
14 years 2 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
ESOP
2012
Springer
12 years 4 months ago
2012
Springer
Communicating finite state machines (CFSMs) represent processes which communicate by asynchronous exchanges of messages via FIFO channels. Their major impact has been in character...
WIA
2004
Springer
14 years 2 months 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...