Author:
Bozzelli Laura,Legay Axel,Pinchinat Sophie
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126(2), 183–235 (1994)
2. Balcázar, J.L., Gabarró, J., Santha, M.: Deciding bisimilarity is p-complete. Formal Asp. Comput. 4(6A), 638–648 (1992)
3. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114–133 (1981)
4. Lecture Notes in Computer Science;O. Kupferman,1997
5. Lecture Notes in Computer Science;J.F. Groote,1992
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献