NDLI: Symbolic Partition Refinement with Dynamic Balancing of Time and Space

Content Provider	IEEE Xplore Digital Library
Author	Wimmer, R. Derisavi, S. Hermanns, H.
Copyright Year	2008
Description	Author affiliation: Inst. of Comput. Sci., Albert-Ludwigs-Univ. Freiburg, Freiburg (Wimmer, R.) \|\| IBM Toronto Software Lab., Toronto, ON (Derisavi, S.) \|\| Dept. of Comput. Sci., Saarland Univ., Saarbrucken (Hermanns, H.)
Abstract	Bisimulation minimization is one of the classical means to fight the infamous state space explosion problem in verification. Particularly in stochastic verification, numerical algorithms are applied, which do not scale beyond systems of moderate size. To alleviate this problem, symbolic bisimulation minimization has been used effectively to reduce very large symbolically represented state spaces to moderate size explicit representations. But even this minimization may fail due to time or memory limitations. This paper presents a symbolic algorithm which relies on a hybrid symbolic partition representation. It dynamically converts between two known representations in order to provide a trade-off between memory consumption and runtime. The conversion itself is logarithmic in the partition size. We show how to apply it for the minimization of Markov chains, but the same techniques can be adapted in a straightforward way to other models like labeled transition systems or interactive Markov chains.
Starting Page	65
Ending Page	74
File Size	409321
Page Count	10
File Format	PDF
ISBN	9780769533605
DOI	10.1109/QEST.2008.14
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-09-14
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Algorithm design and analysis Boolean functions Markov Chains Memory management Bisimulation Chromium Minimization Data structures Partitioning algorithms BDDs
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

Symbolic partition refinement with dynamic balancing of time and space

Symbolic partition refinement with automatic balancing of time and space

Optimization of sequential verification by history-based dynamic minimization of BDDs

Minimization of large state spaces using symbolic branching bisimulation

Generalized Boolean symmetries through nested partition refinement

Fast exact minimization of BDDs

Fast Boolean matching based on NPN classification

Genetic algorithm for ordering and reduction of BDDs for MIMO circuits

Lazy symbolic model checking

Symbolic Partition Refinement with Dynamic Balancing of Time and Space

Similar Documents

Symbolic partition refinement with dynamic balancing of time and space

Symbolic partition refinement with automatic balancing of time and space

Optimization of sequential verification by history-based dynamic minimization of BDDs

Minimization of large state spaces using symbolic branching bisimulation

Generalized Boolean symmetries through nested partition refinement

Fast exact minimization of BDDs

Fast Boolean matching based on NPN classification

Genetic algorithm for ordering and reduction of BDDs for MIMO circuits

Lazy symbolic model checking

Symbolic Partition Refinement with Dynamic Balancing of Time and Space