Publication Records

KUČERA, Antonín and Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science. Amsterdam, Nizozemí: Elsevier, 2006, vol. 358, 2-3, p. 315-333. ISSN 0304-3975.

KUNC, Michal. Undecidability of the trace coding problem and some decidable cases. Theoretical Computer Science. Amsterdam: Elsevier, 2004, vol. 310, 1-3, p. 393-456. ISSN 0304-3975.

BRIM, Luboš, Jean-Marie JACQUET, David GILBERT and Mojmír KŘETÍNSKÝ. Modelling Multi-Agents Systems as Concurrent Constraint Processes. Computing and Informatics. 2003, vol. 21, No 6, p. 565-590, 25 pp. ISSN 1335-9150.

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.

BRIM, Luboš, Petr JANČAR, Mojmír KŘETÍNSKÝ and Antonín KUČERA. CONCUR 2002 - Concurrency Theory. 13th International Conference. (CONCUR 2002 - Concurrency Theory. 13th International Conference. Proceedings.). 2002.

BRIM, Luboš, Petr JANČAR, Mojmír KŘETÍNSKÝ and Antonín KUČERA. CONCUR 2002 - Concurrency Theory. 13th International Conference. Proceedings. Berlin, Heidelberg, New York: Springer, 2002, 609 pp. Lecture Notes in Computer Science, vol. 2421. ISBN 3-540-44043-7.

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.

KUČERA, Antonín and 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, 2002, p. 433-445. ISBN 3-540-44040-2.

KUČERA, Antonín and Richard MAYR. Simulation Preorder over Simple Process Algebras. Information and Computation. Academic Press, 2002, vol. 173, No 2, p. 184-198. ISSN 0890-5401.

KUČERA, Antonín and 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, 2002, p. 276-291. ISBN 3-540-44240-5.

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.

KUČERA, Antonín and 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, 2002, p. 594-609. ISBN 3-540-44043-7.

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.

ESPARZA, Javier, Antonín KUČERA and Stefan SCHWOON. Model-Checking LTL with Regular Valuations for Pushdown Systems. N. Kobayashi, B.C. Pierce (Eds.). In Proceedings of 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001). Berlin, Heidelberg, New York: Springer, 2001, p. 316-340. Lecture Notes in Computer Science, vol. 2215. ISBN 3-540-42736-8.

BRIM, Luboš, Jean-Marie JACQUET, David GILBERT and Mojmír KŘETÍNSKÝ. Multi-Agents Systems as Concurrent Constraint Processes. In SOFSEM 2001 28th Conf.on Current Trends in Theory and Practice of Informatics. Heldelberg: Springer Verlag, 2001, p. 201-210. Lecture Notes in Computer Science, vol.2234. ISBN 0302-9743.

STREJČEK, Jan. Rewrite Systems with Constraints. In EXPRESS'01 the 8th International Workshop on Expressiveness in Concurrency. Aalborg (Denmark): Elsevier Science, 2001, p. 1-20.

STREJČEK, Jan. Constrained Rewrite Transition Systems. Brno: FI MU, 2000. Report Series, FIMU-RS-2000-12.

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.

KUČERA, Antonín. Efficient Verification Algorithms for One-Counter Processes. U. Montanari, J.D.P. Rolim, E. Welzl (Eds.). In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000). Berlin, Heidelberg, New York: Springer, 2000, p. 317-328. Lecture Notes in Computer Science, vol. 1853. ISBN 3-540-67715-1.

KUČERA, Antonín. On Simulation-Checking with Sequential Systems. Jifeng He, Masahiko Sato (Eds.). In Proceedings of 6th Asian Computing Science Conference (ASIAN 2000). Berlin, Heidelberg, New York: Springer, 2000, p. 133-148. Lecture Notes in Computer Science, vol. 1961. ISBN 3-540-41428-2.

JANČAR, Petr, Antonín KUČERA and Faron MOLLER. Simulation and Bisimulation over One-Counter Processes. H. Reichel, S. Tison (Eds.). In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000). Berlin, Heidelberg, New York: Springer, 2000, p. 334-345. Lecture Notes in Computer Science, vol. 1770. ISBN 3-540-67141-2.

BRIM, Luboš, Jean-Marie JACQUET, David GILBERT and Mojmír KŘETÍNSKÝ. A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming. FI MU Report Series. Brno: FI MU, 1999, vol. 1999, No 08, p. 1-62.

KUČERA, Antonín and Javier ESPARZA. A Logical Viewpoint on Process-Algebraic Quotients. J. Flum, M. Rodríguez-Artalejo (Eds.). In Computer Science Logic; Proceedings of 8th Annual Conference of the EACSL (CSL´99). Berlin: Springer, 1999, p. 499-514. Lecture Notes in Computer Science, vol. 1683. ISBN 3-540-66536-6.

Č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. On Finite Representations of Infinite-State Behaviours. Information Processing Letters. Elsevier, 1999, vol. 70, No 1, p. 23-30. ISSN 0020-0190.

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

KUČERA, Antonín and Richard MAYR. Simulation Preorder on Simple Process Algebras. J. Wiedermann, P. van Emde Boas, M. Nielsen (Eds.). In Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP'99). Berlin: Springer, 1999, p. 503-512. Lecture Notes in Computer Science, vol. 1644. ISBN 3-540-66224-3.

KUČERA, Antonín and 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, 1999, p. 368-382. Lecture Notes in Computer Science, vol. 1664. ISBN 3-540-66425-4.

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 and Mojmír KŘETÍNSKÝ. MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings. FI MU Report Series. Brno: FI MU, 1998, vol. 1998, No 06, p. 1-209.

Č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. 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.

KUČERA, Antonín. On Finite Representations of Infinite-State Behaviours. F. Plášil, K.G. Jeffery (Eds.). In Proceedings of 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'97). Berlin: Springer, 1997, p. 481-488. Lecture Notes in Computer Science, vol. 1338. ISBN 3-540-63774-5.

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. 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.