NDLI: Implicit manipulation of equivalence classes using binary decision diagrams

Content Provider	IEEE Xplore Digital Library
Author	Lin, B. Newton, A.R.
Copyright Year	1991
Description	Author affiliation: California Univ., Berkeley, CA, USA (Lin, B.; Newton, A.R.)
Abstract	A novel representation called an equivalence class characterization function is defined. It can implicitly represent all equivalence classes with a compact characteristic function that will have at most n outputs. Using binary decision diagrams (BDDs) and the concept of the equivalence class characterization function, very large problem instances can be represented. For manipulating equivalence classes efficiently, a Boolean operator called a compatible projection operator is proposed. Conceptually, the compatible projection operator is used to uniquely select a single element from each equivalence class to characterize the class. In manipulating equivalence classes, the compatible projection operator is used to implicitly derive an encoding function from the equivalence relation that encodes the equivalence class information symbolically. An efficient implementation is described based on BDDs that is applied to very large problem instances.<>
Starting Page	81
Ending Page	85
File Size	514570
Page Count	5
File Format	PDF
ISBN	0818622709
DOI	10.1109/ICCD.1991.139995
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1991-10-14
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Data structures Boolean functions Logic Complexity theory Binary decision diagrams State-space methods Machinery Automata Encoding Computational modeling
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

First-order checking of ω - automata using MDGs

Boolean satisfiability and equivalence checking using general binary decision diagrams

Computing the observable equivalence relation of a finite state machine

Restructuring binary decision diagrams based on functional equivalence

Implicit state enumeration of finite state machines using BDD's

Symbolic protocol verification with queue BDDs

Exact minimization of binary decision diagrams using implicit techniques

Implicit and incremental computation of primes and essential primes of Boolean functions

Incremental re-encoding for symbolic traversal of product machines

Implicit manipulation of equivalence classes using binary decision diagrams

Similar Documents

First-order checking of ω - automata using MDGs

Boolean satisfiability and equivalence checking using general binary decision diagrams

Computing the observable equivalence relation of a finite state machine

Restructuring binary decision diagrams based on functional equivalence

Implicit state enumeration of finite state machines using BDD's

Symbolic protocol verification with queue BDDs

Exact minimization of binary decision diagrams using implicit techniques

Implicit and incremental computation of primes and essential primes of Boolean functions

Incremental re-encoding for symbolic traversal of product machines

Implicit manipulation of equivalence classes using binary decision diagrams