346 search results - page 19 / 70 » Determinizing Asynchronous Automata |
JACM
2007
14 years 10 months ago
2007
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of reg...
SASO
2008
IEEE
15 years 4 months ago
2008
IEEE
We propose a self-organizing sleep-wake sensor system that is scalable, easily implemented, and energy conserving. An application of concepts from cellular automata theory account...
ECAL
1999
Springer
15 years 2 months ago
1999
Springer
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...
FMSD
2008
14 years 10 months ago
2008
Abstract. This paper is concerned with the derivation of infinite schedules for timed automata that are in some sense optimal. To cover a wide class of optimality criteria we start...
CONCUR
2008
Springer
14 years 11 months ago
2008
Springer
Software transactional memory (STM) offers a disciplined concurrent programming model for exploiting the parallelism of modern processor architectures. This paper presents the firs...