Model checking and boolean graphs
 Henrik Reif Andersen
 … show all 1 hide
Abstract
This paper describes a method for translating a satisfaction problem of the modal μcalculus into a problem of finding a certain marking of a boolean graph. By giving algorithms to solve the graph problem, we present a global model checking algorithm for the modal μcalculus of alternation depth one, which has timecomplexity ¦A¦¦T¦, where ¦A¦ is the size of the assertion and ¦T¦ is the size of the model (a labelled transition system). This algorithm extends to an algorithm for the full modal μcalculus which runs in time (¦A¦¦T¦)^{ad}, where ad is the alternation depth, improving on earlier presented algorithms. Moreover, a local algorithm is presented for alternation depth one, which runs in time ¦A¦¦T¦log(¦A¦¦T¦), improving on the earlier published algorithms that are all at least exponential.
 Title
 Model checking and boolean graphs
 Book Title
 ESOP '92
 Book Subtitle
 4th European Symposium on Programming Rennes, France, February 26–28, 1992 Proceedings
 Pages
 pp 119
 Copyright
 1992
 DOI
 10.1007/3540552537_1
 Print ISBN
 9783540552536
 Online ISBN
 9783540468035
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 582
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Henrik Reif Andersen ^{(1)}
 Author Affiliations

 1. Department of Computer Science, Aarhus University, Ny Munkegade 116, DK8000, Aarhus C, Denmark
Continue reading...
To view the rest of this content please follow the download PDF link above.