✦ LIBER ✦

State assignment and testability of PLA-based finite state machines

✍ Scribed by Giacomo Buonanno; Micaela Serra

Publisher: Elsevier Science
Year: 1992
Weight: 433 KB
Volume: 35
Category: Article
ISSN: 0165-6074
DOI: 10.1016/0165-6074(92)90344-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simulated Annealing Based Parallel State

Simulated Annealing Based Parallel State Assignment of Finite State Machines

✍ Gagan Hasteer; Prithviraj Banerjee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 371 KB

Spiking neurons and the induction of fin

Spiking neurons and the induction of finite state machines

✍ Thomas Natschläger; Wolfgang Maass 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Application of the novel associative pro

Application of the novel associative programmable array-structure multi-match-PLA in synthesis of decomposed finite state machines

✍ J. Kottsieper; K. Waldschmidt 📂 Article 📅 1993 🏛 Elsevier Science ⚖ 827 KB

Estimators for logic minimization and im

Estimators for logic minimization and implementation selection of finite state machines

✍ A.J.W.M. ten Berg 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 468 KB

Reconfigurable models of finite state ma

Reconfigurable models of finite state machines and their implementation in FPGAs

✍ V. Sklyarov 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 635 KB

Symbolic model checking of extended fini

Symbolic model checking of extended finite state machines with linear constraints over integer variables

✍ Takashi Takenaka; Kozo Okano; Teruo Higashino; Kenichi Taniguchi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract We propose a symbolic model checking algorithm for a class of extended finite state machines equipped with integer variables (FSM/int). An FSM/int has several constraints on variable assignments, such as a variable of FSM/int keeps its value until the control visits at the definition tr