NDLI: Markovian analysis of large finite state machines

Content Provider	IEEE Xplore Digital Library
Author	Hachtel, G.D. Macii, E. Pardo, A. Somenzi, F.
Copyright Year	1982
Abstract	Regarding finite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal verification problems. In this paper we present symbolic algorithms to compute the steady-state probabilities for very large finite state machines (up to 10/sup 27/ states). These algorithms, based on Algebraic Decision Diagrams (ADD's)-an extension of BDD's that allows arbitrary values to be associated with the terminal nodes of the diagrams-determine the steady-state probabilities by regarding finite state machines as homogeneous, discrete-parameter Markov chains with finite state spaces, and by solving the corresponding Chapman-Kolmogorov equations. We first consider finite state machines with state graphs composed of a single terminal strongly connected component; for this type of system we have implemented two solution techniques: One is based on the Gauss-Jacobi iteration, the other one is based on simple matrix multiplication. Then we extend our treatment to the most general case of systems which can be modelled as finite state machines with arbitrary transition structures; here our approach exploits structural information to decompose and simplify the state graph of the machine. We report experimental results obtained for problems on which traditional methods fail.
Sponsorship	IEEE Council on Electronic Design Automation IEEE Circuits and Systems Society
Starting Page	1479
Ending Page	1493
Page Count	15
File Size	442469
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	Automata Steady-state Probabilistic logic Formal verification Data structures Boolean functions State-space methods Equations Gaussian processes Matrix decomposition
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

An industrially effective environment for formal hardware verification

On the verification of sequential equivalence

Implicit enumeration of strongly connected components and an application to formal verification

SAT-based unbounded symbolic model checking

NOVA: state assignment of finite state machines for optimal two-level logic implementation

Structural FSM traversal

Automatic synthesis of low-power gated-clock finite-state machines

Comparing layouts with HDL models: a formal verification technique

Analyzing Functional Coverage in Bounded Model Checking

Markovian analysis of large finite state machines

Similar Documents

An industrially effective environment for formal hardware verification

On the verification of sequential equivalence

Implicit enumeration of strongly connected components and an application to formal verification

SAT-based unbounded symbolic model checking

NOVA: state assignment of finite state machines for optimal two-level logic implementation

Structural FSM traversal

Automatic synthesis of low-power gated-clock finite-state machines

Comparing layouts with HDL models: a formal verification technique

Analyzing Functional Coverage in Bounded Model Checking

Markovian analysis of large finite state machines