Sciweavers

283 search results - page 20 / 57
» A New DNA Implementation of Finite State Machines
Sort
View
ISCIS
2009
Springer
14 years 2 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
PTS
2004
94views Hardware» more  PTS 2004»
13 years 9 months ago
FSM Based Interoperability Testing Methods for Multi Stimuli Model
In this paper, we propose two fault models and methods for the derivation of interoperability test suites when the system implementation is given in the form of two deterministic c...
Khaled El-Fakih, Vadim Trenkaev, Natalia Spitsyna,...
CEC
2003
IEEE
14 years 1 months ago
Learning DFA: evolution versus evidence driven state merging
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...
Simon M. Lucas, T. Jeff Reynolds
EUROMICRO
2009
IEEE
13 years 11 months ago
Formal Semantics of the ProCom Real-Time Component Model
ProCom is a new component model for real-time and embedded systems, targeting the domains of vehicular and telecommunication systems. In this paper, we describe how the architectur...
Aneta Vulgarakis, Jagadish Suryadevara, Jan Carlso...
APIN
2002
121views more  APIN 2002»
13 years 7 months ago
Applying Learning by Examples for Digital Design Automation
This paper describes a new learning by example mechanism and its application for digital circuit design automation. This mechanism uses finite state machines to represent the infer...
Ben Choi