7311 search results - page 281 / 1463 » Time in State Machines |
180
click to vote
ELPUB
2006
ACM
16 years 1 months ago
2006
ACM
This paper deals with the problems of weakening of human memory due to the increasing use of machine memories in many ways. It enumerates the advantages of machine memory as state...
161
click to vote
ICCS
2004
Springer
16 years 20 days ago
2004
Springer
This work focuses on the synthesis of finite-state machines (FSMs) by observing its input/output behaviors. Evolutionary approaches that have been proposed to solve this problem do...
242
click to vote
ACL
1996
15 years 8 months ago
1996
We present a language model consisting of a collection of costed bidirectional finite state automata associated with the head words of phrases. The model is suitable for increment...
188
click to vote
CAV
2005
Springer
16 years 25 days ago
2005
Springer
In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachabilit...
182
click to vote
REX
1991
15 years 10 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...