Publication Records

JANČAR, Petr and Jiří SRBA. Undecidability of Bisimilarity by Defender's Forcing. Journal of the ACM. New York: ACM, 2008, 55/2008, No 1, p. 1-26. ISSN 0004-5411.

JANČAR, Petr and Jiří SRBA. Undecidability Results for Bisimilarity on Prefix Rewrite Systems. LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06). Netherlands: Spinger-Verlag, 2006, vol. 2006, No 3921, p. 277-291.

SRBA, Jiří. Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation. LNCS, Annual Conference on Computer Science Logic (CSL'06). Netherlands: Springer-Verlag, 2006, vol. 2006, No 4207, p. 89-103.

SRBA, Jiří. Completeness Results for Undecidable Bisimilarity Problems. In Proccedings of the 5th International Workshop on Verification of Infinite-State Systems (INFINITY'03). Marseille, France: Universire de Provence, Marseille, 2004, p. 9-22.

JANČAR, Petr, Antonín KUČERA, Faron MOLLER and Zdeněk SAWA. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation. Academic Press, 2004, vol. 188, No 1, p. 1-19. ISSN 0890-5401.

MOLLER, Faron, Scot SMOLKA and Jiří SRBA. On the Computational Complexity of Bisimulation, Redux. Information and Computation. Netherlands: Elsevier Science, 2004, ?, ?, p. ?, 20 pp. ISSN 0890-5401.

SRBA, Jiří. Roadmap of Infinite Results. Current Trends in Theoretical Computer Science, The Challenge of the New Century. New York, USA: World Scientific Publishing, 2004, vol. 2, No 1, p. 337-350.

JANČAR, Petr, Antonín KUČERA and Faron MOLLER. Deciding Bisimilarity between BPA and BPP Processes. R. Amadio, D. Lugiez (Eds.). In Proceedings of 14th International Conference on Concurrency Theory (CONCUR 2003). Berlin: Springer, 2003, p. 159-174. ISBN 3-540-40753-7.

SRBA, Jiří. Strong Bisimilarity of Simple Process Algebras: Complexity Lower Bounds. Acta Informatica. The Netherlands: Springer-Verlag, 2003, vol. 39, No 1, p. 469-499.

KUČERA, Antonín. The Complexity of Bisimilarity-Checking for One-Counter Processes. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2003, vol. 304, 1-3, p. 157-183. ISSN 0304-3975.

JURDZINSKI, Martin, Nielsen MOGENS and Jiří SRBA. Undecidability of Domino Games and Hhp-Bisimilarity. Information and Computation. Netherlands: Springer-Verlag, 2003, vol. 184, No 2, p. 343-368. ISSN 0890-5401.

JANČAR, Petr, Antonín KUČERA, Faron MOLLER and Zdeněk SAWA. Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds. In Proceedings of 5th International Conference on Foundations of Software Science and Computation Structures (FOSSACS 2002). Berlin, Heidelberg, New York: Springer, 2002, p. 172-186. ISBN 3-540-43366-X.

SRBA, Jiří. Roadmap of Infinite Results. Bulletin of the European Association for Theoretical Computer Science. Bratislava: EATCS, 2002, vol. 2002, No 78, p. 163-175. ISSN 78.

KUČERA, Antonín and Richard MAYR. Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time. Theoretical Computer Science. Amsterdam, Nizozemí, 2002, vol. 270, 1-2, p. 677-700. ISSN 0304-3975.

JANČAR, Petr, Antonín KUČERA and Richard MAYR. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Theoretical Computer Science. Amsterdam, Nizozemí, 2001, vol. 258, 1-2, p. 409-433. ISSN 0304-3975.

KUČERA, Antonín. Effective Decomposability of Sequential Behaviours. Theoretical Computer Science. Amsterdam, Nizozemí, 2000, vol. 242, 1-2, p. 71-89. ISSN 0304-3975.

ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta informatica. Berlin: Springer-Verlag, 1999, vol. 36, No 3, p. 233-256. ISSN 0001-5903.

KUČERA, Antonín. Regularity of normed PA processes. Information Processing Letters. Elsevier, 1999, vol. 72, 1-2, p. 9-17. ISSN 0020-0190.

JANČAR, Petr, Antonín KUČERA and Richard MAYR. Bisimilarity of Processes with Finite-State Systems. K. Larsen, S. Skyum, G. Winskel (Eds.). In Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98). Berlin: Springer, 1998, p. 200-211. Lecture Notes in Computer Science, vol. 1443. ISBN 3-540-64781-3.

JANČAR, Petr, Antonín KUČERA and Mayr RICHARD. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical Report TUM. Germany: Technical University Munich, 1998, vol. 1998, TUM-I9805, p. 1-24.

KUČERA, Antonín and Mayr RICHARD. Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time. Technical Report TUM. Germany: Technical University Munich, 1998, vol. 1998, TUM-I9830, p. 1-28.

ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. Electronic Notes in Theoretical Computer Science. Elsevier, 1997, vol. 1997, No 5, p. 1-24.

JANČAR, Petr and Antonín KUČERA. Bisimilarity of Processes with Finite-state Systems. FI MU Report Series. Brno: FI MU, 1997, vol. 1997, RS-97-02, p. 1-19.

JANČAR, Petr and Antonín KUČERA. Bisimilarity of Processes with Finite-State Systems. F. Moller (Editor). In Proceedings of 2nd International Workshop on Verification of Infinite State Systems (INFINITY´97). Uppsala (Sweden): University of Uppsala, 1997, p. 72-85. UPMAIL TR No. 148. ISBN 1100-0686.

JANČAR, Petr and Antonín KUČERA. Bisimilarity of Processes with Finite-State Systems. Electronic Notes in Theoretical Computer Science. Elsevier, 1997, vol. 1997, No 9, p. 1-14.

KUČERA, Antonín. How to Parallelize Sequential Processes. A. Mazurkiewicz, J. Winkowski (Eds.). In Proceedings of 8th International Conference on Concurrency Theory (CONCUR´97). Berlin: Springer, 1997, p. 302-316. Lecture Notes in Computer Science, vol. 1243. ISBN 3-540-63141-0.

ČERNÁ, Ivana, Mojmír KŘETÍNSKÝ and Antonín KUČERA. Comparing Expressibility of Normed BPA and Normed BPP Processes. FI MU Report Series. Brno: FI MU, 1996, vol. 1996, RS-96-02, p. 1-28.

KUČERA, Antonín. How to Parallelize Sequential Processes. FI MU Report Series. Brno: FI MU, 1996, vol. 1996, RS-96-05, p. 1-24.

KUČERA, Antonín. Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. K.G. Jeffery, J. Král, M. Bartošek (Eds.). In Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96). Berlin: Springer, 1996, p. 377-384. Lecture Notes in Computer Science, vol. 1175. ISBN 3-540-61994-1.

KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. FI MU Report Series. Brno: FI MU, 1996, vol. 1996, RS-96-01, p. 1-17.

KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. V. Chandru, V. Vinay (Eds.). In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96). Berlin: Springer, 1996, p. 111-122. Lecture Notes in Computer Science, vol. 1180. ISBN 3-540-62034-6.