Sciweavers

1202 search results - page 76 / 241
» Sortings for Reactive Systems
Sort
View
ATVA
2005
Springer
130views Hardware» more  ATVA 2005»
15 years 9 months ago
Approximate Reachability for Dead Code Elimination in Esterel
Esterel is an imperative synchronous programming language for the design of reactive systems. Esterel extends Esterel with a noninstantaneous jump instruction (compatible with conc...
Olivier Tardieu, Stephen A. Edwards
ICRA
2003
IEEE
114views Robotics» more  ICRA 2003»
15 years 9 months ago
Robotic catching using a direct mapping from visual information to motor command
— In this paper a robotic catching algorithm based on a nonlinear mapping of visual information to the desired trajectory is proposed. The nonlinear mapping is optimized by learn...
Akio Namiki, Masatoshi Ishikawa
103
Voted
CSL
2006
Springer
15 years 7 months ago
Solving Games Without Determinization
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...
Thomas A. Henzinger, Nir Piterman
ENTCS
2007
94views more  ENTCS 2007»
15 years 4 months ago
Matching of Bigraphs
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way f...
Lars Birkedal, Troels Christoffer Damgaard, Arne J...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 10 months ago
Dynamical blueprints: exploiting levels of system-environment interaction
Developmental systems typically produce a phenotype through a generative process whose outcome depends on feedback from the environment. In most artificial developmental systems, ...
Nicolás S. Estévez, Hod Lipson