Author:
Bruse Florian,Lange Martin,Lozes Etienne
Publisher
Springer International Publishing
Reference18 articles.
1. Andersen, H.R.: A polyadic modal $$\mu $$ -calculus. Technical Report ID-TR: 1994–195, Dept. of Computer Science, Technical University of Denmark, Copenhagen (1994)
2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);R Axelsson,2007
3. Axelsson, R., Lange, M., Somla, R.: The complexity of model checking higher-order fixpoint logic. Logical Meth. Comput. Sci. 3, 1–33 (2007)
4. Emerson, E.A.: Uniform inevitability is tree automaton ineffable. Inf. Process. Lett. 24(2), 77–79 (1987)
5. Harel, D., Pnueli, A., Stavi, J.: Propositional dynamic logic of nonregular programs. J. Comput. Syst. Sci. 26(2), 222–243 (1983)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献