7 search results - page 1 / 2 » Optimal Zielonka-Type Construction of Deterministic Asynchro... |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Asynchronous automata are parallel compositions of finitestate processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trac...
OPODIS
2004
14 years 11 months ago
2004
Consider an asynchronous system where each process begins with an arbitrary real value. Given some fixed > 0, an approximate agreement algorithm must have all non-faulty process...
106
click to vote
TC
2002
14 years 9 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....