Improving BDD Based Symbolic Model Checking with Isomorphism Exploiting Transition Relations
Symbolic model checking by using BDDs has greatly improved the applicability of model checking. Nevertheless, BDD based symbolic model checking can still be very memory and time consuming. One main reason is the complex transition relation of systems. Sometimes, it is even not possible to generate t...
Main Author: | Christian Appold |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2011-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1106.1229v1 |
Similar Items
-
Symbolic model checking techniques for BDD-based planning in distributed environments
by: Goel, Anuj, 1973-
Published: (2011) -
Symbolische BDD-basierte Modellprüfung asynchroner nebenläufiger Systeme
by: Appold, Christian
Published: (2015) -
Efficient Symmetry Reduction and the Use of State Symmetries for Symbolic Model Checking
by: Christian Appold
Published: (2010-06-01) -
Symbolic BDD and ADD Algorithms for Energy Games
by: Shahar Maoz, et al.
Published: (2016-11-01) -
Optimizing the Microstructure and Corrosion Resistance of BDD Coating to Improve the Service Life of Ti/BDD Coated Electrode
by: Xin ru Lu, et al.
Published: (2019-09-01)