Author:
Emerson E.Allen,Jutla Charanjit S.,Sistla A.Prasad
Subject
General Computer Science,Theoretical Computer Science
Reference19 articles.
1. O. Bernholtz, M. Vardi, P. Wolper, An automata theoretic approach to branching time modelchecking. Proc. 6th Internat. Conf. on Computer Aided Verification, CAV ’94, Stanford, CA, June 1994.
2. Tableux-based model checking in the propositional μ-calculus;Cleaveland;Acta Informatica,1990
3. R. Cleaveland, B. Steffen, A linear-time model checking for alternation free modal μ-calculus, Proc. 3rd Workshop on Computer Aided Verification, Aalborg, Lecture Notes in Computer Science, Springer, Berlin, July 1991.
4. R. Cleaveland, B. Steffen, Faster model checking for modal μ-calculus, Proc. 4th Workshop on Computer Aided Verification, Montreal, July 1991.
Cited by
72 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Priority Promotion with Parysian flair;Journal of Computer and System Sciences;2025-02
2. Complete Game Logic with Sabotage;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
3. Probabilistic Runtime Enforcement of Executable BPMN Processes;Lecture Notes in Computer Science;2024
4. Extensible Proof Systems for Infinite-State Systems;ACM Transactions on Computational Logic;2023-11-18
5. Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games;Lecture Notes in Computer Science;2023