921 search results - page 88 / 185 » On Interleaving in Timed Automata |
192
click to vote
FORMATS
2004
Springer
15 years 11 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...
216
click to vote
ESOP
2012
Springer
14 years 1 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...
163
click to vote
WIA
2004
Springer
15 years 11 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...
152
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We introduce dynamic communicating automata (DCA), an extension of communicating finite-state machines that allows for dynamic creation of processes. Their behavior can ...
186
click to vote
SIGSOFT
2008
ACM
15 years 6 months ago
2008
ACM
If an organization depends on the service quality provided by another organization it often enters into a bilateral service level agreement (SLA), which mitigates outsourcing risk...