On model-checking for fragments of μ-calculus-Reference-Cited by-同舟云学术

On model-checking for fragments of μ-calculus

Published:1993 Issue: Volume: Page:385-396
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Emerson E. A.,Jutla C. S.,Sistla A. P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56922-7_32.pdf

Reference13 articles.

1. R. Cleaveland, Tableux-based model checking in the propositional μ-calculus, Acta Informatica, 27:725–747, 1990.

2. R. Cleaveland and B. Steffen, A linear-time model-checking for alternation free modal fi-calculus, Proceedings of the 3rd workshop on Computer Aided Verification, Aalborg, LNCS, Springer-Verlag, July 1991.

3. R. Cleaveland and B. Steffen, Faster model-checking for modal μ-calculus, Proceedings of the 4th workshop on Computer Aided Verification, Montreal, July 1991.

4. E. A. Emerson, E. M. Clarke, Characterizing correctness properties of parallel programs Using Fixpoints, Proceedings of the International Conference on Automata, Languages and Programming, 1980.

5. E.A. Emerson and C. S. Jutla, Tree Automata, Mu-calculus and Determinacy, Proceedings of the 1991 IEEE Symposium on Foundations of Computer Science.

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

1. An Objective Improvement Approach to Solving Discounted Payoff Games;Electronic Proceedings in Theoretical Computer Science;2023-09-30

2. Good-for-Game QPTL: An Alternating Hodges Semantics;ACM Transactions on Computational Logic;2023-01-23

3. Universal Algorithms for Parity Games and Nested Fixpoints;Lecture Notes in Computer Science;2022

4. An ordered approach to solving parity games in quasi-polynomial time and quasi-linear space;International Journal on Software Tools for Technology Transfer;2019-02-25

5. Solving parity games via priority promotion;Formal Methods in System Design;2018-01-31