Optimizing Symbolic Model Checking for Constraint-Rich Models
This paper presents optimizations for verifying systems with complex timeinvariant constraints. These constraints arise naturally from modeling physical systems, e.g., in establishing the relationship between different components in a system. To verify constraint-rich systems, we propose two new opt...
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Published: |
Springer
1999
|
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.811 http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.35.811 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.35.811 2023-05-15T13:41:21+02:00 Optimizing Symbolic Model Checking for Constraint-Rich Models Bwolen Yang Reid Simmons Randal E. Bryant David R. O'hallaron The Pennsylvania State University CiteSeerX Archives 1999 application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.811 http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps en eng Springer http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.811 http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps symbolic model checking Binary Decision Diagram (BDD timeinvariant constraints redundant state-variable elimination text 1999 ftciteseerx 2016-01-08T00:18:11Z This paper presents optimizations for verifying systems with complex timeinvariant constraints. These constraints arise naturally from modeling physical systems, e.g., in establishing the relationship between different components in a system. To verify constraint-rich systems, we propose two new optimizations. The first optimization is a simple, yet powerful, extension of the conjunctivepartitioning algorithm. The second is a collection of BDD-based macro-extraction and macro-expansion algorithms to remove state variables. We show that these two optimizations are essential in verifying constraint-rich problems; in particular, this work has enabled the verification of fault diagnosis models of the Nomad robot (an Antarctic meteorite explorer) and of the NASA Deep Space One spacecraft. 1 Introduction To Appear in CAV'99. This paper presents techniques for using symbolic model checking to automatically verify a class of real-world applications that have many time-invariant constraints. Text Antarc* Antarctic Unknown Antarctic |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
topic |
symbolic model checking Binary Decision Diagram (BDD timeinvariant constraints redundant state-variable elimination |
spellingShingle |
symbolic model checking Binary Decision Diagram (BDD timeinvariant constraints redundant state-variable elimination Bwolen Yang Reid Simmons Randal E. Bryant David R. O'hallaron Optimizing Symbolic Model Checking for Constraint-Rich Models |
topic_facet |
symbolic model checking Binary Decision Diagram (BDD timeinvariant constraints redundant state-variable elimination |
description |
This paper presents optimizations for verifying systems with complex timeinvariant constraints. These constraints arise naturally from modeling physical systems, e.g., in establishing the relationship between different components in a system. To verify constraint-rich systems, we propose two new optimizations. The first optimization is a simple, yet powerful, extension of the conjunctivepartitioning algorithm. The second is a collection of BDD-based macro-extraction and macro-expansion algorithms to remove state variables. We show that these two optimizations are essential in verifying constraint-rich problems; in particular, this work has enabled the verification of fault diagnosis models of the Nomad robot (an Antarctic meteorite explorer) and of the NASA Deep Space One spacecraft. 1 Introduction To Appear in CAV'99. This paper presents techniques for using symbolic model checking to automatically verify a class of real-world applications that have many time-invariant constraints. |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
Bwolen Yang Reid Simmons Randal E. Bryant David R. O'hallaron |
author_facet |
Bwolen Yang Reid Simmons Randal E. Bryant David R. O'hallaron |
author_sort |
Bwolen Yang |
title |
Optimizing Symbolic Model Checking for Constraint-Rich Models |
title_short |
Optimizing Symbolic Model Checking for Constraint-Rich Models |
title_full |
Optimizing Symbolic Model Checking for Constraint-Rich Models |
title_fullStr |
Optimizing Symbolic Model Checking for Constraint-Rich Models |
title_full_unstemmed |
Optimizing Symbolic Model Checking for Constraint-Rich Models |
title_sort |
optimizing symbolic model checking for constraint-rich models |
publisher |
Springer |
publishDate |
1999 |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.811 http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps |
geographic |
Antarctic |
geographic_facet |
Antarctic |
genre |
Antarc* Antarctic |
genre_facet |
Antarc* Antarctic |
op_source |
http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.811 http://www-cgi.cs.cmu.edu/afs/cs.cmu.edu/usr/bwolen/www/papers/cav99-tr.ps |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766149712882171904 |