Sciweavers

512 search results - page 58 / 103
» Automata as Abstractions
Sort
View
CSR
2006
Springer
14 years 11 days ago
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
Marie-Pierre Béal, Sylvain Lombardy, Jacque...
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
13 years 10 months ago
Search decisions for teams of automata
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
Dimitar Baronov, John Baillieul
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 8 months ago
Stochastic Minority on Graphs
Abstract. Cellular automata have been mainly studied for on very regular graphs carrying the cells (like lines or grids) and under synchronous dynamics (all cells update simultaneo...
Jean-Baptiste Rouquier, Damien Regnault, Eric Thie...
CONCUR
2006
Springer
13 years 10 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
TCS
2008
13 years 8 months ago
Verification of qualitative Z constraints
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints, comparis...
Stéphane Demri, Régis Gascon