Výpis publikací

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

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

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

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

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

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

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

KUČERA, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. FI MU Report Series. Brno: FI MU, 1996, roč. 1996, RS-96-01, s. 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, s. 111-122. Lecture Notes in Computer Science, vol. 1180. ISBN 3-540-62034-6.

KUČERA, Antonín. Deciding Regularity in Process Algebras. BRICS Report Series. Denmark: BRICS, 1995, roč. 1995, RS-95-52, s. 1-42. ISSN 0909-0878.