Implicit state enumeration of finite state machines using BDD's

Autor:	H.J. Touati, Bill Lin, Robert K. Brayton, Alberto Sangiovanni-Vincentelli, Hamid Savoj
Rok vydání:	2002
Předmět:	Set (abstract data type) Deterministic finite automaton Finite-state machine Theoretical computer science Binary decision diagram Heuristic Quantum finite automata State diagram Algorithm State transition table Mathematics
Zdroj:	ICCAD Scopus-Elsevier
Popis:	The authors propose a novel method based on transition relations that only requires the ability to compute the BDD (binary decision diagram) for f/sub i/ and outperforms O. Coudert's (1990) algorithm for most examples. The method offers a simple notational framework to express the basic operations used in BDD-based state enumeration algorithms in a unified way and a set of techniques that can speed up range computation dramatically, including a variable ordering heuristic and a method based on transition relations. >
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::547708cbc70a14aa1d1faf9262ec5cd6 https://doi.org/10.1109/iccad.1990.129860 Zobrazit plný text záznamu