Author:
Edelkamp Stefan,Lafuente Alberto Lluch,Leue Stefan
Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. A. Biere. μcke-efficient μ-calculus model checking. In Computer Aided Verification, pages 468–471, 1997.
2. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323–342, Apr 1983.
3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
5. A. D. E. Muller and P. Schnupp. Alternating automata. the weak monadic theory of the tree and its complexity. In International Colloquim on Automata, Languages and Programming.
Cited by
75 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献