Sciweavers

921 search results - page 87 / 185
» On Interleaving in Timed Automata
Sort
View
OPODIS
2010
15 years 4 months ago
On the Automated Implementation of Time-Based Paxos Using the IOA Compiler
Paxos is a well known algorithm for achieving consensus in distributed environments with uncertain processing and communication timing. Implementations of its variants have been s...
Chryssis Georgiou, Procopis Hadjiprocopiou, Peter ...
IANDC
2011
129views more  IANDC 2011»
15 years 1 months ago
Rigid tree automata and applications
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a res...
Florent Jacquemard, Francis Klay, Camille Vacher
TCS
2011
15 years 1 months ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
TSMC
2002
105views more  TSMC 2002»
15 years 5 months ago
On the use of learning automata in the control of broadcast networks: a methodology
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...
Georgios I. Papadimitriou, Mohammad S. Obaidat, An...
ESOP
2004
Springer
15 years 11 months ago
From Constraints to Finite Automata to Filtering Algorithms
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...
Mats Carlsson, Nicolas Beldiceanu