Efficient local model-checking for fragments of the modal Μ-calculus-Reference-Cited by-同舟云学术

Efficient local model-checking for fragments of the modal Μ-calculus

Published:1996 Issue: Volume: Page:107-126
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Bhat Girish,Cleaveland Rance

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-61042-1_41.pdf

Reference20 articles.

1. H.R. Andersen. Model checking and boolean graphs. In Proceedings of the European Symposium on Programming, volume 582 of Lecture Notes in Computer Science, pages 1–19, Rennes, France, March 1992. Springer-Verlag.

2. O. Bernholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In Dill [9], pages 142–155.

3. G. Bhat, R. Cleaveland, and O. Grumberg. Efficient on-the-fly model checking for CTL*. In Tenth Annual Symposium on Logic in Computer Science (LICS '95), pages 388–397, San Diego, July 1995. IEEE Computer Society Press.

4. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, April 1986.

5. R. Cleaveland. Tableau-based model checking in the propositional mu-calculus. Acta Informatica, 27(8):725–747, September 1990.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Local Strategy Improvement for Parity Game Solving;Electronic Proceedings in Theoretical Computer Science;2010-06-09

2. Model Checking for Hybrid Logic;Journal of Logic, Language and Information;2009-04-23

3. The Complexity of Enriched μ-Calculi;Automata, Languages and Programming;2006

4. Probabilistic temporal logics via the modal mu-calculus;Theoretical Computer Science;2005-09

5. Solving Alternating Boolean Equation Systems in Answer Set Programming;Lecture Notes in Computer Science;2005