1246 search results - page 103 / 250 » Recursive Timed Automata |
139
click to vote
WIA
2004
Springer
15 years 10 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...
131
click to vote
CSR
2010
Springer
15 years 9 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 ...
158
Voted
SIGSOFT
2008
ACM
15 years 4 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...
160
click to vote
ATVA
2009
Springer
15 years 11 months ago
2009
Springer
Parity games are 2-player games of perfect information and infinite duration that have important applications in automata theory and decision procedures (validity as well as model...
134
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
We suggest that a process-like notion of strategy is relevant in the context of interactions in systems of self-interested agents. In this view, strategies are not plans formulated...