Sciweavers

221 search results - page 24 / 45
» From MITL to Timed Automata
Sort
View
DFT
2006
IEEE
122views VLSI» more  DFT 2006»
13 years 11 months ago
Efficient and Robust Delay-Insensitive QCA (Quantum-Dot Cellular Automata) Design
The concept of clocking for QCA, referred to as the four-phase clocking, is widely used. However, inherited characteristics of QCA, such as the way to hold state, the way to synch...
Minsu Choi, Myungsu Choi, Zachary D. Patitz, Nohpi...
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
ATAL
1995
Springer
13 years 11 months ago
Time, Knowledge, and Choice
Abstract. This article considers the link between theory and practice in agentoriented programming. We begin by rigorously defining a new formal specification language for autono...
Michael Wooldridge