Sciweavers

2465 search results - page 44 / 493
» Automata on Linear Orderings
Sort
View
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
13 years 2 months ago
Networked clock synchronization based on second order linear consensus algorithms
In this paper a distributed algorithm for clock synchronization is proposed. This algorithm is based on an extension of the consensus algorithm able to synchronize a family of dou...
Ruggero Carli, Sandro Zampieri
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 2 months ago
On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data
This paper studies the “explanation problem” for tree- and linearly-ordered array data, a problem motivated by database applications and recently solved for the one-dimensiona...
Howard J. Karloff, Flip Korn, Konstantin Makaryche...
ICALP
2010
Springer
13 years 9 months ago
Efficient Evaluation of Nondeterministic Automata Using Factorization Forests
In the first part of the paper, we propose an algorithm which inputs an NFA A and a word a1
Mikolaj Bojanczyk, Pawel Parys
TIT
2008
106views more  TIT 2008»
13 years 7 months ago
Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
This article describes new theoretical results concerning the general behavior of a Feedback with Carry Shift Register (FCSR) automaton. They help to better understand how the init...
François Arnault, Thierry P. Berger, Marine...
QEST
2008
IEEE
14 years 2 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...