NDLI: On the Computation of the Set of Reachable States of Hybrid Models

Content Provider	IEEE Xplore Digital Library
Author	Krishnakumar, A.S. Kwang-Ting Cheng
Copyright Year	1994
Description	Author affiliation: AT&T Bell Laboratories, Murray Hill, NJ (Krishnakumar, A.S.)
Abstract	In this paper, we present a method to compute symbolically, the set of configurations reachable from the initial configuration of an Extended Finite State Machine. Our representation allows variables of arbitrary type (boolean, arithmetic etc.) to be freely mixed. We define a class of EFSMs called direct sum machines and show how the reachable set of configurations for this class can be computed. In the computation, we use a hybrid model to represent sets of configurations. Sets of states formed by boolean variables are represented by BDDs and sets of states formed by arithmetic variables are represented as polyhedral regions. This method can be adapted to perform validation, verification, test generation etc. for sequential machines. We describe an implementation of this approach and the results of applying it to some design examples.
Starting Page	615
Ending Page	621
File Size	252039
Page Count	7
File Format	PDF
ISBN	0897916530
ISSN	0738100X
DOI	10.1109/DAC.1994.204177
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-06-06
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Association for Computing Machinery, Inc. (ACM)
Subject Keyword	Arithmetic Automata Data structures Boolean functions Performance evaluation Circuit testing Sequential analysis Hardware
Content Type	Text
Resource Type	Article

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

Calculation of arithmetic spectra from free binary decision diagrams

Testability analysis of pipelined data paths

Combining symbolic and genetic techniques for efficient sequential circuit test generation

Dependent latch identification in the reachable state space

On the computation of the set of reachable states of hybrid models

Sequential circuit verification using symbolic model checking

Implicit depth-first state traversal of sequential machines

Application driven variable reordering and an example implementation in reachability analysis

Data-path testability analysis based on BDDs

On the Computation of the Set of Reachable States of Hybrid Models

Similar Documents

Calculation of arithmetic spectra from free binary decision diagrams

Testability analysis of pipelined data paths

Combining symbolic and genetic techniques for efficient sequential circuit test generation

Dependent latch identification in the reachable state space

On the computation of the set of reachable states of hybrid models

Sequential circuit verification using symbolic model checking

Implicit depth-first state traversal of sequential machines

Application driven variable reordering and an example implementation in reachability analysis

Data-path testability analysis based on BDDs

On the Computation of the Set of Reachable States of Hybrid Models