Sciweavers

732 search results - page 91 / 147
» Axiomatising timed automata
Sort
View
JAC
2008
13 years 9 months ago
Quantization of cellular automata
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
Pablo Arrighi, Vincent Nesme
AAAI
1992
13 years 8 months ago
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exp...
Thomas Dean, Dana Angluin, Kenneth Basye, Sean P. ...
IJAC
2007
99views more  IJAC 2007»
13 years 7 months ago
Normalized Expressions and Finite Automata
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
Jean-Marc Champarnaud, Faissal Ouardi, Djelloul Zi...
RAS
2006
86views more  RAS 2006»
13 years 7 months ago
Using cellular automata and gradients to control self-reconfiguration
Self-reconfigurable robots are built from modules, which are autonomously able to change the way they are connected. Such a robot can, through this self-reconfiguration process, c...
Kasper Støy
CAV
2007
Springer
98views Hardware» more  CAV 2007»
14 years 1 months ago
UPPAAL-Tiga: Time for Playing Games!
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
Gerd Behrmann, Agnès Cougnard, Alexandre Da...