7311 search results - page 38 / 1463 » Time in State Machines |
FASE
2006
Springer
13 years 11 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
HASE
1997
IEEE
13 years 11 months ago
1997
IEEE
Fault-tolerant behavior is an important non-functional requirement for systems that involve high criticality. We present a framework which allows the analysis of faulttolerant beh...
COMPSAC
2002
IEEE
14 years 10 days ago
2002
IEEE
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
SEC
2003
13 years 8 months ago
2003
Abstract This paper presents a systematic approach to developing Java Card applets and/or formal specifications for them, starting from descriptions in the form of finite state m...
EMNLP
2004
13 years 8 months ago
2004
State-of-the-art machine translation techniques are still far from producing high quality translations. This drawback leads us to introduce an alternative approach to the translat...