✦ LIBER ✦

Symbolic forward/backward traversals of large finite state machines

✍ Scribed by Gianpiero Cabodi; Paolo Camurati; Stefano Quer

Book ID: 104425916
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 313 KB
Volume: 46
Category: Article
ISSN: 1383-7621
DOI: 10.1016/s1383-7621(00)00014-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Symbolic two-dimensional minimization of

Symbolic two-dimensional minimization of strongly unspecified finite state machines

✍ M.A Perkowski; L Jóźwiak; W Zhao 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 161 KB

Implicit manipulation of equivalence cla

Implicit manipulation of equivalence classes for large finite state machines

✍ Cabodi, G.; Camurati, P.; Quer, S. 📂 Article 📅 1998 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 846 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

Learning a class of large finite state m

Learning a class of large finite state machines with a recurrent neural network

✍ C. Lee Giles; B.G. Horne; T. Lin 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Extension of forward-backward method wit

Extension of forward-backward method with a DFT-based acceleration algorithm for efficient analysis of radiation/scattering from large finite-printed dipole arrays

✍ Özlem Aydın Çivi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 473 KB

## Abstract A discrete‐Fourier‐transform (DFT) based forward‐backward (FB) algorithm has been developed for the fast and accurate analysis of electrically large freestanding dipole arrays [1]. In this paper, an extension of the FB method (FBM) with a DFT‐based acceleration approach is presented to