All in-text references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.

allowed many FSM models to be verified due to the compact representations they provide. However, there still remain circuits for which the traversal cannot be carried out due to the size of the Transition Relation (TR) BDD becoming too large. Pruning algorithms designed to reduce the size of a BDD while

generation of outputs. FSM-Hume is a strict finite state subset of Hume, where symbols are constrained to fixed size types and transition functions are non-recursive. Here we discuss the design of FSM-Hume and show that it is indeed classically finite state. 1.1

We propose a structured design methodology to construct FSM-based programmable memory BIST. The proposed BIST can be programmed on-line, with a “macro command”, to select a test algorithm from a predetermined set of algorithms that are built in the memory BIST. In general, there are a variety

networks can be made efficient and effective. Finally, we give preliminary results on some artificially constructed FSM networks. Preliminary results indicate that our approach can be effective in reducing the size of a component of an FSM network. 1

Given the relevance of software functional size measurement to the industry and in practice, improved ways to represent and handle the measurement details can provide significant advantages and make possible to discover new interpretation and exploitation possibilities over measurement results

of the application. The size of the model is independent of the number of executions of the application. Since we are able to capture all this behavior in a single SADF model we can use available dataflow analysis, such as worst-case and best-case throughput and deadlock-freedom checking. Furthermore, since

years. We collected forty three cultivars from Chuuk and Pohnpei states of the Federated States of Micronesia. After morphological characterization of their petioles, leaves and corms, we identified 15 different groups. We determined percentage survival, mean sucker number, monthly mean corm size

We propose Finite State Machine (FSM) re-engineering, a performance enhancement framework for FSM synthesis and optimization procedure. We start with any traditional FSM synthesis and optimization procedure; then re-construct a functionally equivalent but topologically different FSM based

of previously proposed techniques is that they require the state transition graph (STG) of the FSM to be given or extracted from the circuit. Since the size of the STG can be exponential on the number of registers in the circuit, explicit techniques can only be applied to relatively small sequential circuits