NDLI: Algorithms for approximate FSM traversal based on state space decomposition

Content Provider	IEEE Xplore Digital Library
Author	Hyunwoo Cho Hachtel, G.D. Macii, E. Plessier, B. Somenzi, F.
Copyright Year	1982
Abstract	This paper presents algorithms for approximate finite state machine traversal based on state space decomposition. The original finite state machine is partitioned in component submachines, and each of them is traversed separately; the result of the computation is an over-estimation of the set of reachable states of the original machine. Different traversal strategies, which reduce the effects of the degrees of freedom introduced by the decomposition, are discussed. Efficient partitioning is a key point for the performance of the traversal techniques; a method to heuristically find a good decomposition of the overall finite state machine, based on the exploration of its state variable dependency graph, is proposed. Applications of the approximate traversal methods to logic optimization of sequential circuits and behavioral verification of finite state machines are described; experimental results for such applications, together with data concerning pure traversal, are reported.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	1465
Ending Page	1478
Page Count	14
File Size	487332
File Format	PDF
ISSN	02780070
Volume Number	15
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1996-12-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	State-space methods Automata Sequential circuits Partitioning algorithms Reachability analysis Explosions Binary decision diagrams Logic devices Optimization methods Information retrieval
Content Type	Text
Resource Type	Article
Subject	Computer Graphics and Computer-Aided Design Electrical and Electronic Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Structural FSM traversal

Automatic state space decomposition for approximate FSM traversal based on circuit analysis

Unbounded Protocol Compliance Verification Using Interval Property Checking With Invariants

Dependent-Latch Identification in Reachable State Space

On partitioning and symbolic model checking

Improving the efficiency of BDD-based operators by means of partitioning

On the verification of sequential equivalence

Optimum and heuristic algorithms for an approach to finite state machine decomposition

Symbolic FSM traversals based on the transition relation

Algorithms for approximate FSM traversal based on state space decomposition

Similar Documents

Structural FSM traversal

Automatic state space decomposition for approximate FSM traversal based on circuit analysis

Unbounded Protocol Compliance Verification Using Interval Property Checking With Invariants

Dependent-Latch Identification in Reachable State Space

On partitioning and symbolic model checking

Improving the efficiency of BDD-based operators by means of partitioning

On the verification of sequential equivalence

Optimum and heuristic algorithms for an approach to finite state machine decomposition

Symbolic FSM traversals based on the transition relation

Algorithms for approximate FSM traversal based on state space decomposition