6 search results - page 1 / 2 » Estimating the feasibility of transition paths in extended f... |
ASE
2010
13 years 5 months ago
2010
ICST
2009
IEEE
13 years 12 months ago
2009
IEEE
The problem of testing from an extended finite state machine (EFSM) can be expressed in terms of finding suitable paths through the EFSM and then deriving test data to follow the ...
DAC
1994
ACM
13 years 9 months ago
1994
ACM
In current research, the minimum cycle times of finite state machines are estimated by computing the delays of the combinational logic in the finite state machines. Even though th...
CN
2004
13 years 5 months ago
2004
The problem of testing from an SDL specification is often complicated by the presence of infeasible paths. This paper introduces an approach for transforming a class of SDL specif...
FAC
2008
2008
Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine
13 years 5 months ago
A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...