2467 search results - page 235 / 494 » Finite State Machines |
143
click to vote
LATIN
1992
Springer
15 years 10 months ago
1992
Springer
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
159
click to vote
JELIA
1990
Springer
15 years 10 months ago
1990
Springer
In Floyd-Hoare logic, programs are dynamic while assertions are static (hold at states). In action logic the two notions become one, with programs viewed as on-the-fly assertions ...
187
click to vote
CDC
2009
IEEE
15 years 10 months ago
2009
IEEE
This paper studies the input design problem for system identification where time domain constraints have to be considered. A finite Markov chain is used to model the input of the s...
195
click to vote
HYBRID
2000
Springer
15 years 10 months ago
2000
Springer
A problem of great interest in the control of hybrid systems is the design of least restrictive controllers for reachability specifications. Controller design typically uses game t...
171
click to vote
NIPS
2008
15 years 8 months ago
2008
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...