Author:
Böhm Stanislav,Göller Stefan,Jančar Petr
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Balcázar, J.L., Gabarró, J., Santha, M.: Deciding Bisimilarity is P-Complete. Formal Asp. Comput. 4(6A), 638–648 (1992)
2. Brázdil, T., Brozek, V., Etessami, K., Kučera, A., Wojtczak, D.: One-Counter Markov Decision Processes. In: Proc. of SODA, pp. 863–874. IEEE, Los Alamitos (2010)
3. Lecture Notes in Computer Science;S. Demri,2010
4. Glabbeek, R.v.: The Linear Time – Branching Time Spectrum I; The Semantics of Concrete, Sequential Processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of Process Algebra, ch. 1, pp. 3–99. Elsevier, Amsterdam (2001)
5. Göller, S., Mayr, R., To, A.W.: On the Computational Complexity of Verifying One-Coúnter Processes. In: Proc. of LICS, pp. 235–244. IEEE Computer Society Press, Los Alamitos (2009)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献