Generating Finite-State Abstractions of Reactive Systems using Decision Procedures (1998)
| Venue: | in Computer Aided Verification |
| Citations: | 65 - 5 self |
BibTeX
@INPROCEEDINGS{Colon98generatingfinite-state,
author = {Michael A. Colon and Tomás E. Uribe and Michael A. Col'on and Tom'as E. Uribe},
title = {Generating Finite-State Abstractions of Reactive Systems using Decision Procedures},
booktitle = {in Computer Aided Verification},
year = {1998},
pages = {293--304},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ions of Reactive Systems using Decision Procedures ? Michael A. Col'on and Tom'as E. Uribe Computer Science Department, Stanford University Stanford, CA 94305 colon---uribe@cs.stanford.edu Abstract. We present an algorithm that uses decision procedures to generate finite-state abstractions of possibly infinite-state systems. The algorithm compositionally abstracts the transitions of the system, relative to a given, fixed set of assertions. Thus, the number of validity checks is proportional to the size of the system description, rather than the size of the abstract state-space. The generated abstractions are weakly preserving for 8CTL* temporal properties. We describe several applications of the algorithm, implemented using the decision procedures of the Stanford Temporal Prover (STeP). In 10 th International Conference on Computer Aided Verification, Vol. 1427 of Lecture Notes in Computer Science, pp. 293--304 Springer-Verlag, June/July 1998. 1 Introduction An attractive method...
