67 search results - page 4 / 14 » Reconfigurable models of finite state machines and their imp... |
AHS
2006
IEEE
14 years 1 months ago
2006
IEEE
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
TCS
2010
13 years 6 months ago
2010
There has been much interest in testing from finite state machines (FSMs) as a result of their suitability for modelling or specifying state-based systems. Where there are multip...
ECBS
2004
IEEE
13 years 11 months ago
2004
IEEE
If a software implementation is to be generated fully automatically from a model, then the model must be detailed and totally complete. For the definition of software implementing...
WSC
1998
13 years 9 months ago
1998
Causality constraints of random discrete simulation make parallel and distributed processing difficult. Methods of applying reconfigurable logic to implement and accelerate simula...
KBSE
2008
IEEE
14 years 1 months ago
2008
IEEE
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...