Výpis publikací

KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK a Jan STREJČEK. Refining Undecidability Border of Weak Bisimilarity. In Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05). 2006. vyd. Amsterdam, The Netherlands: Elsevier Science. s. 17-36. ISSN 1571-0661. 2006.

SRBA, Jiří. Complexity of Weak Bisimilarity and Regularity for BPA and BPP. Mathematical Structures in Computer Science. Great Britain: Cambridge University Press, roč. 12, č. 1, s. 567587-567607. ISSN 0960-1295. 2003.

SRBA, Jiří. Undecidability of Weak Bisimilarity for PA-Processes. In Proceedings of 6th International Conference on Developments in Language Theory (DLT'02),. Netherlands: Springer-Verlag. s. 197-208. 2003.

KUČERA, Antonín a Richard MAYR. On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. K. Diks, W. Rytter (Eds.). In Proceedings of 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002). Berlin: Springer. s. 433-445. ISBN 3-540-44040-2. 2002.

KUČERA, Antonín a Jan STREJČEK. The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. J. Bradfield (Ed.). In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02). Berlin: Springer. s. 276-291. ISBN 3-540-44240-5. 2002.

SRBA, Jiří. Undecidability of Weak Bisimilarity for Pushdown Processes. In Proceedings of 13th International Conference on Concurrency Theory (CONCUR'02). Holland: Springer-Verlag. s. 579-593. 2002.

KUČERA, Antonín a Richard MAYR. Why is Simulation Harder Than Bisimulation? L. Brim, P. Jancar, M. Kretinsky, A. Kucera (Eds.). In Proceedings of 13th International Conference on Concurrency Theory (CONCUR 2002). Berlin: Springer. s. 594-609. ISBN 3-540-44043-7. 2002.

STŘÍBRNÁ, Jitka. Decidability and complexity of equivalences for simple process algebras. Edinburgh: University of Edinburgh. 125 s. LFCS Report Series, ECS-LFCS-99-408. 1999.

KUČERA, Antonín a Mayr RICHARD. Simulation Preorder on Simple Process Algebras. Technical Report TUM. Germany: Technical University Munich, roč. 1999, TUM-I9902, s. 1-23, 1999.

KUČERA, Antonín a Richard MAYR. Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. J.C.M. Baeten, S. Mauw (Eds.). In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin: Springer. s. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4. 1999.

STŘÍBRNÁ, Jitka. Hardness results for weak bisimilarity of simple process algebras. In Proceedings of MFCS'98 Workshop on Concurrency. Netherlands: Elsevier. s. 175-183. ENTCS Volume 18. 1998.