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.
 André Arnold and Paul Crubille. A linear algorithm to solve fixedpoint equations on transitions systems. Information Processing Letters, 29:57–66, 1988.
 Henrik Reif Andersen and Glynn Winskel. Compositional checking of satisfaction. In Larsen and Skou [LS91]. To appear.
 H. Bekić. Definable operations in general algebras, and the theory of automata and flow charts. Lecture Notes in Computer Science, 177, 1984.
 Rance Cleaveland. Tableaubased model checking in the propositional mucalculus. Acta Informatica, 27:725–747, 1990.
 Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGrawHill, 1990.
 Rance Cleaveland, Joachim Parrow, and Bernhard Steffen. The Concurrency Workbench: A semantics based tool for the verification of concurrent systems. Technical Report ECSLFCS8983, Laboratory for Foundations of Computer Science, Uni. of Edinburgh, August 1989.
 Rance Cleaveland and Bernhard Steffen. A lineartime modelchecking algorithm for the alternationfree modal mucalculus. In Larsen and Skou [LS91]. To appear.
 Mads Dam. Translating CTL^{*} into the modal μcalculus. Technical Report ECSLFCS90123, Laboratory for Foundations of Computer Science, Uni. of Edinburgh, November 1990.
 William F. Dowling and Jean H. Gallier. Lineartime algorithms for testing the satisfiability of propositional Horn formulae. Journal of Logic Programming, 1 (3):267–284, 1984.
 E. Allen Emerson and ChinLuang Lei. Efficient model checking in fragments of the propositional mucalculus. In Symposium on Logic in Computer Science, Proceedings, pages 267–278. IEEE, 1986.
 Dexter Kozen. Results on the prepositional mucalculus. Theoretical Computer Science, 27, 1983.
 Kim G. Laxsen. Proof systems for HennessyMilner logic with recursion. In Proceedings of CAAP, 1988.
 Kim G. Larsen, J.C. Godskesen, and M. Zeeberg. TAVTools for Automatic Verification. Technical Report R 8919, Aalborg Universitetscenter, 1989.
 Kim G. Larsen and Arne Skou, editors. Proceedings of the 3rd Workshop on Computer Aided Verification, Aalborg, LNCS. SpringerVerlag, July 1991. To appear.
 Kim G. Larsen and Liu Xinxin. Compositionality through an operational semantics of contexts. In M.S. Paterson, editor, Proceedings of ICALP, volume 443 of LNCS, pages 526–539. SpringerVerlag, 1990.
 Colin Stirling and David Walker. Local model checking in the modal mucalculus. In Proceedings of TAPSOFT, 1989.
 A. Tarski. A latticetheoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 1955.
 Glynn Winskel. A note on model checking the modal vcalculus. In Ausiello, DezaniCiancaglini, and Rocca, editors, Proceedings of ICALP, volume 372 of LNCS, 1989.
 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.