Prof. RNDr. Antonín Kučera, Ph.D.
|
BRÁZDIL, Tomáš - BROŽEK, Václav - ETESSAMI, Kousha - KUČERA, Antonín.
Approximating the Termination Value of One-Counter MDPs and Stochastic Games. In Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Berlin : Springer, 2011. ISBN 978-3-642-22011-1, pp. 332-343. 2011, Zurich, Switzerland.
BRÁZDIL, Tomáš - KIEFER, Stefan - KUČERA, Antonín.
Efficient Analysis of Probabilistic Programs with an Unbounded Counter. In Computer Aided Verification, 23rd International Conference, CAV 2011. Berlin : Springer, 2011. ISBN 978-3-642-22109-5, pp. 208-224. 14.7.2011, Snowbird, UT, USA.
BRÁZDIL, Tomáš - KRČÁL, Jan - KŘETÍNSKÝ, Jan - KUČERA, Antonín - ŘEHÁK, Vojtěch.
Measuring Performance of Continuous-Time Stochastic Processes using Timed Automata. In HSCC 11: Proceedings of the 14th International Conference on Hybrid Systems: Computation and Control. New York : ACM, 2011. ISBN 978-1-4503-0629-4, pp. 33-42. 12.4.2011, Chicago, IL, USA.
BRÁZDIL, Tomáš - BROŽEK, Václav - KUČERA, Antonín - OBDRŽÁLEK, Jan.
Qualitative Reachability in Stochastic BPA Games. Information and Computation, Elsevier, The Nederlands. ISSN 0890-5401, 2011, vol. 209, no. 8, pp. 1160-1183.
KUČERA, Antonín.
Randomness: A Tool for Constructing and Analyzing Computer Programs. In Randomness through Computation. New Jersey : World Scientific, 2011. Neuveden, ISBN 978-981-4327-74-9, pp. 275-282.
BRÁZDIL, Tomáš - KIEFER, Stefan - KUČERA, Antonín - HUTAŘOVÁ VAŘEKOVÁ, Ivana.
Runtime Analysis of Probabilistic Programs with Unbounded Recursion. In Proceedings of 38th International Colloquium on Automata, Languages and Programming (ICALP 2011). Berlin : Springer, 2011. ISBN 978-3-642-22011-1, pp. 319-331. 2011, Zurich, Switzerland.
KUČERA, Antonín.
Turn-Based Stochastic Games. In Apt, Krzysztof R. - Grädel, Erich. Lectures in Game Theory for Computer Scientists. Cambridge, United Kingdom : Cambridge University Press, 2011. Neuveden, ISBN 978-0-521-19866-0, pp. 146-184.
BROŽEK, Václav - BRÁZDIL, Tomáš - CHATTERJEE, Krishnendu - FOREJT, Vojtěch - KUČERA, Antonín.
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. In Proceedings 26th Annual IEEE Symposium on Logic in Computer Science. Los Alamitos, California : IEEE, 2011. ISBN 978-0-7695-4412-0, pp. 33-42. 2011, Toronto, Canada.
HLINĚNÝ, Petr - KUČERA, Antonín.
35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010). 2010. CZE, Brno, Czech Republic. 23.8.2010 - 27.8.2010, Worldwide Activity.
KUČERA, Antonín - POTAPOV, Igor.
4th International Workshop on Reachability Problems. 2010. CZE, Brno, Czech Republic. 28.8.2010 - 29.8.2010, Worldwide Activity.
KUČERA, Antonín.
Effective Analysis of Infinite State Stochastic Processes and Games. In Esparza, Javier - Spanfelner, Bernd - Grumberg, Orna. Logics and Languages for Reliability and Security. Amsterdam, The Netherlands : IOS Press, 2010. NATO Science for Peace and Security Series, D, 25, ISBN 978-1-60750-099-5, pp. 155-179.
HLINĚNÝ, Petr - KUČERA, Antonín (Eds.).
Mathematical Foundations of Computer Science 2010. Berlin Heidelberg New York : Spriger, 2010. 714 pp. ISBN 3-642-15154-X.
KUČERA, Antonín - MAYR, Richard.
On the Complexity of Checking Semantic Equivalences between Pushdown Processes and Finite-state Processes. Information and Computation, Elsevier, The Nederlands. ISSN 0890-5401, 2010, vol. 208, no. February, pp. 772-796.
BRÁZDIL, Tomáš - BROŽEK, Václav - ETESSAMI, Kousha - KUČERA, Antonín - WOJTCZAK, Dominik.
One-Counter Markov Decision Processes. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms. Neuveden : SIAM, 2010. ISBN 978-0-89871-698-6, pp. 863-874. 2010, Austin (Texas, USA).
BRÁZDIL, Tomáš - JANČAR, Petr - KUČERA, Antonín.
Reachability Games on Extended Vector Addition Systems with States. In Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP 2010). Berlin : Springer, 2010. ISBN 3-642-14161-7, pp. 478-489. 2010, Bordeaux, France.
KUČERA, Antonín - POTAPOV, Igor (Eds.).
Reachability Problems. Berlin Heidelberg New York : Springer, 2010. 197 pp. ISBN 3-642-15348-8.
BRÁZDIL, Tomáš - KRČÁL, Jan - KŘETÍNSKÝ, Jan - KUČERA, Antonín - ŘEHÁK, Vojtěch.
Stochastic Real-Time Games with Qualitative Timed Automata Objectives. In CONCUR 2010 - Concurrency Theory. Berlin Heidelberg New York : Springer, 2010. ISBN 3-642-15374-7, pp. 207-221. 31.8.2010, Paris, France.
BRÁZDIL, Tomáš - FOREJT, Vojtěch - KRČÁL, Jan - KŘETÍNSKÝ, Jan - KUČERA, Antonín.
Continuous-Time Stochastic Games with Time-Bounded Reachability. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009). Dagstuhl, Germany : Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2009. ISBN 978-3-939897-13-2, pp. 61-72. 15.12.2009, IIT Kanpur, India.
BRÁZDIL, Tomáš - BROŽEK, Václav - KUČERA, Antonín - OBDRŽÁLEK, Jan.
Qualitative Reachability in Stochastic BPA Games. In Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science. Freiburg, Germany : IBFI Schloss Dagstuhl, 2009. ISBN 978-3-939897-09-5, pp. 207-218. 2009, Freiburg, Germany.
NIELSEN, Mogens - KUČERA, Antonín - MILTERSEN, Peter Bro - PALAMIDESSI, Catuscia - TŮMA, Petr - VALENCIA, Frank - BIELIKOVÁ, Mária (Eds.).
SOFSEM 2009: Theory and Practice of Computer Science. Prague : MATFYZPRESS, 2009. 132 pp. ISBN 978-80-7378-059-3.
MOGENS, Nielsen - KUČERA, Antonín - MILTERSEN, Peter Bro - PALAMIDESSI, Catuscia - TŮMA, Petr - VALENCIA, Frank (Eds.).
SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science : Špindlerův Mlýn, Czech Republic, January 2009, Proceedings. Berlin : Springer, 2009. 670 pp. ISBN 978-3-540-95890-1.
BRÁZDIL, Tomáš - FOREJT, Vojtěch - KUČERA, Antonín.
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives. In Automata, Languages and Programming. 35th International Colloquium, ICALP 2008. Reykjavik, Iceland, July 2008. Proceedings, Part II. Berlin, Heidelberg, New York : Springer, 2008. ISBN 3-540-70582-1, pp. 148-159. 7.7.2008, Reykjavik, Iceland.
BRÁZDIL, Tomáš - KUČERA, Antonín - STRAŽOVSKÝ, Oldřich.
Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta informatica, Berlin, Springer-Verlag, Germany. ISSN 0001-5903, 2008, vol. 45, no. 2, pp. 131-154.
BRÁZDIL, Tomáš - BROŽEK, Václav - HOLEČEK, Jan - KUČERA, Antonín.
Discounted Properties of Probabilistic Pushdown Automata. In Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008. Berlin Heidelberg New York : Springer, 2008. ISBN 978-3-540-89438-4, pp. 230-242. 22.11.2008, Doha, Qatar.
KUČERA, Antonín - STRAŽOVSKÝ, Oldřich.
On the Controller Synthesis for Finite-State Markov Decision Processes. Fundamenta Informaticae, Polsko, IOS Press, Nizozemí, Poland. ISSN 0169-2968, 2008, vol. 82, no. 1-2, pp. 141-153.
BRÁZDIL, Tomáš - BROŽEK, Václav - FOREJT, Vojtěch - KUČERA, Antonín.
Reachability in Recursive Markov Decision Processes. Information and Computation, Elsevier, The Nederlands. ISSN 0890-5401, 2008, vol. 206, no. 5, pp. 520-537.
BRÁZDIL, Tomáš - FOREJT, Vojtěch - KŘETÍNSKÝ, Jan - KUČERA, Antonín.
The Satisfiability Problem for Probabilistic CTL. In 23rd IEEE Symposium on Logic in Computer Science (LICS 2008), 24-27 June 2008, Pittsburgh, USA, Proceedings. Los Alamitos, California : IEEE Computer Society, 2008. ISBN 978-0-7695-3183-0, pp. 391-402. 24.6.2008, Pittsburgh, USA.
KUČERA, Antonín.
Verification of Infinite State Probabilistic Systems. 2008.
KUČERA, Luděk - KUČERA, Antonín (Eds.).
32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007). Berlin Heidelberg New York : Springer, 2007. ISBN 3-540-74455-X.
KUČERA, Luděk - KUČERA, Antonín (Eds.).
Mathematical Foundations of Computer Science 2007. Berlin Heidelberg New York : Springer, 2007. 764 pp. ISBN 3-540-74455-X.
KUČERA, Luděk - KUČERA, Antonín.
Mathematical Foundations of Computer Science 2007. Berlin Heidelberg New York : Springer, 2007. 764 pp. Lecture Notes in Computer Science, vol. 4708. ISBN 3-540-74455-X.
BAIER, Christel - BRÁZDIL, Tomáš - GRÖßER, Marcus - KUČERA, Antonín.
Stochastic Game Logic. In Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007). Los Alamitos, Washington, Tokyo : IEEE Computer Society, 2007. ISBN 0-7695-2883-X, pp. 227-236. 16.9.2007, Edinburgh, Scotland.
KUČERA, Antonín - SCHNOEBELEN, Philippe.
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. Theoretical Computer Science, Amsterdam, Nizozemí, Elsevier, The Nederlands. ISSN 0304-3975, 2006, vol. 358, no. 2-3, pp. 315-333.
KUČERA, Antonín - JANČAR, Petr.
Equivalence-Checking on Infinite-State Systems: Techniques and Results. Theory and practice of logic programming, Cambridge, Cambridge University Press, Great Britain. ISSN 1471-0684, 2006, vol. 6, no. 3, pp. 227-264.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Formální jazyky a automaty I. Elportál, Brno, Masarykova univerzita. ISSN 1802-128X, 2006.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Formální jazyky a automaty I. Brno : Masarykova univerzita, 2006. 159 pp. Elportal.
KUČERA, Antonín.
Methods for Quantitative Analysis of Probabilistic Pushdown Automata. Electronic Notes in Theoretical Computer Science, Elsevier, Germany. ISSN 1571-0661, 2006, vol. 149, no. 1, pp. 3-15.
ESPARZA, Javier - KUČERA, Antonín - MAYR, Richard.
Model Checking Probabilistic Pushdown Automata. Logical Methods in Computer Science, The Nederlands. ISSN 1860-5974, 2006, vol. 2, no. 1-2, pp. 1-31.
MATYSKA, Luděk - KUČERA, Antonín - VOJNAR, Tomáš - KOTÁSEK, Zdeněk - ANTOŠ, David - KRAJÍČEK, Ondřej.
Proceedings of the Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2006). Mikulov : FIT BUT, 2006. 281 pp. Proceedings. ISBN 80-214-3287-X.
BRÁZDIL, Tomáš - BROŽEK, Václav - FOREJT, Vojtěch - KUČERA, Antonín.
Reachability in Recursive Markov Decision Processes. In 17th International Conference on Concurrency Theory. Berlin Heidelberg New York : Springer, 2006. ISBN 3-540-37376-4, pp. 358-374. 2006, Bonn, Germany.
BRÁZDIL, Tomáš - BROŽEK, Václav - FOREJT, Vojtěch - KUČERA, Antonín.
Stochastic Games with Branching-Time Winning Objectives. In 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12-15 August 2006, Seattle, Washington, USA, Proceedings. Los Alamitos, California : IEEE Computer Society, 2006. ISBN 0-7695-2631-4, pp. 349-358. 12.8.2006, Seattle, Washington, USA.
GRUSKA, Jozef - BOUDA, Jan - KUČERA, Antonín - KRAJÍČEK, Ondřej.
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. 2005. CZE, Znojmo. 14.10.2005 - 17.10.2005, Worldwide Activity.
KUČERA, Antonín - GRUSKA, Jozef - ČEŠKA, Milan.
1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005). 2005. CZE, Znojmo. 14.10.2005 - 17.10.2005, Worldwide Activity.
BRÁZDIL, Tomáš - ESPARZA, Javier - KUČERA, Antonín.
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005). Los Alamitos, California : IEEE Computer Society, 2005. ISBN 0-7695-2468-0, pp. 521-530. 23.10.2005, Pittsburgh, Pennsylvania, USA.
BRÁZDIL, Tomáš - KUČERA, Antonín.
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains. In 25th International Conference on Foundations of Software Technology and Theoretical Computer Science. Berlin Heidelberg New York : Springer, 2005. ISBN 3-540-30495-9, pp. 372-383. 2005, Hyderabad, India.
KUČERA, Antonín - STREJČEK, Jan.
Characteristic Patterns for LTL. In SOFSEM 2005: Theory and Practice of Computer Science. Berlin, Heidelberg : Springer-Verlag, 2005. ISBN 3-540-24302-X, pp. 239-249. 2005, Liptovský Ján, Slovakia.
KUČERA, Antonín - STRAŽOVSKÝ, Oldřich.
On the Controller Synthesis for Finite-State Markov Decision Processes. In 25th International Conference on Foundations of Software Technology and Theoretical Computer Science. Berlin Heidelberg New York : Springer, 2005. ISBN 3-540-30495-9, pp. 541-552. 2005, Hyderabad, India.
BRÁZDIL, Tomáš - KUČERA, Antonín - STRAŽOVSKÝ, Oldřich.
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata. In Proceedings of 22nd Symposium on Theoretical Aspects of Computer Science (STACS 2005). Berlin : Springer, 2005. ISBN 3-540-24998-2, pp. 145-157. 2005, February 24 - 26, 2005, Stuttgart, Germany.
KUČERA, Antonín - GRUSKA, Jozef - ČEŠKA, Milan.
Pre-Proceedings of 1st Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2005). Brno : Faculty of Informatics, Masaryk University in Brno, 2005. 224 pp. FI MU Report Series.
ESPARZA, Javier - KUČERA, Antonín - MAYR, Richard.
Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005). Los Alamitos, California : IEEE Computer Society, 2005. ISBN 0-7695-2266-1, pp. 117-126. 26.7.2005, Chicago, Illinois, USA.
KUČERA, Antonín - STREJČEK, Jan.
The stuttering principle revisited. Acta informatica, Berlin, Springer-Verlag, Germany. ISSN 0001-5903, 2005, vol. 41, no. 7/8, pp. 415-434.
KUČERA, Antonín - SCHNOEBELEN, Philippe.
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin : Springer, 2004. ISBN 3-540-22940-X, pp. 371-386. 2004, August 31 - September 3, 2004, London, UK.
KUČERA, Antonín - MAYR, Richard.
A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. In Exploring New Frontiers of Theoretical Informatics : IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004). Boston, Dordrecht, London : Kluwer, 2004. ISBN 1-4020-8140-5, pp. 395-408. 22.8.2004, Toulouse, France.
BRÁZDIL, Tomáš - KUČERA, Antonín - STRAŽOVSKÝ, Oldřich.
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems. In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin : Springer, 2004. ISBN 3-540-22940-X, pp. 193-208. 2004, August 31 - September 3, 2004, London, UK.
JANČAR, Petr - KUČERA, Antonín - MOLLER, Faron - SAWA, Zdeněk.
DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation, Academic Press, USA. ISSN 0890-5401, 2004, vol. 188, no. 1, pp. 1-19.
ESPARZA, Javier - KUČERA, Antonín - MAYR, Richard.
Model Checking Probabilistic Pushdown Automata. In Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004). Los Alamitos (California) : IEEE Computer Society, 2004. ISBN 0-7695-2192-4, pp. 12-21. 13.7.2004, Turku, Finland.
KUČERA, Antonín - ESPARZA, Javier.
A Logical Viewpoint on Process-algebraic Quotients. Journal of logic and computation, Oxford, Oxford University Press, Great Britain. ISSN 0955-792X, 2003, vol. 13, no. 6, pp. 863-880.
JANČAR, Petr - KUČERA, Antonín - MOLLER, Faron.
Deciding Bisimilarity between BPA and BPP Processes. In Proceedings of 14th International Conference on Concurrency Theory (CONCUR 2003). Berlin : Springer, 2003. ISBN 3-540-40753-7, pp. 159-174. 2003, September 3-5, 2003, Marseille, France.
ESPARZA, Javier - KUČERA, Antonín - SCHWOON, Stefan.
Model checking LTL with regular valuations for pushdown systems. Information and Computation, Academic Press, USA. ISSN 0890-5401, 2003, vol. 186, no. 2, pp. 355-376.
KOPEČEK, Ivan - BATŮŠEK, Robert - KUČERA, Antonín.
On Homogeneous Segments. In Text, Speech and Dialogue - 6th International Conference, Proceedings. Berlin : Springer Verlag, 2003. ISBN 0302-9743, pp. 152-157. 2003, České Budějovice, Czech Republic.
KUČERA, Antonín.
The Complexity of Bisimilarity-Checking for One-Counter Processes. Theoretical Computer Science, Amsterdam, Nizozemí, Elsevier, The Nederlands. ISSN 0304-3975, 2003, vol. 304, no. 1-3, pp. 157-183.
BRIM, Luboš - JANČAR, Petr - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
CONCUR 2002 - Concurrency Theory. 13th International Conference.. 2002. CZE, Brno. 20.8.2002 - 23.8.2002, Worldwide Activity.
BRIM, Luboš - JANČAR, Petr - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
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.
KUČERA, Antonín - JANČAR, Petr.
Equivalence-Checking with Infinite-State Systems: Techniques and Results. In Proceedings of 29th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2002). Berlin : Springer, 2002. ISBN 3-540-00145-X, pp. 41-73. 2002, November 22-29, 2002, Milovy, Czech Republic.
JANČAR, Petr - KUČERA, Antonín - MOLLER, Faron - SAWA, Zdeněk.
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. ISBN 3-540-43366-X, pp. 172-186. 2002, Grenoble, France, April 8-12, 2002.
KUČERA, Antonín - MAYR, Richard.
Infinity 2002. 4th International Workshop on Verification of Infinite-State Systems. Amsterdam : Elsevier, 2002. 106 pp. ENTCS, volume 68(6). ISBN 0444513299.
KUČERA, Antonín - MAYR, Richard.
INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems. 2002. CZE, Brno, Czech Republic. 24.8.2002 - 24.8.2002, Worldwide Activity.
KUČERA, Antonín - MAYR, Richard.
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA. In Proceedings of 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002). Berlin : Springer, 2002. ISBN 3-540-44040-2, pp. 433-445. 2002, August 26-30, 2002, Warsaw, Poland.
KUČERA, Antonín - MAYR, Richard.
Simulation Preorder over Simple Process Algebras. Information and Computation, Academic Press, USA. ISSN 0890-5401, 2002, vol. 173, no. 2, pp. 184-198.
KUČERA, Antonín - STREJČEK, Jan.
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL. In Proceedings of the Annual Conference of the European Association for Computer Science Logic (CSL'02). Berlin : Springer, 2002. ISBN 3-540-44240-5, pp. 276-291. 2002, September 22-25, 2002, Edinburgh, Scotland.
KUČERA, Antonín - MAYR, Richard.
Weak Bisimilarity between Finite-State Systems and BPA or normed BPP is Decidable in Polynomial Time. Theoretical Computer Science, Amsterdam, Nizozemí, The Nederlands. ISSN 0304-3975, 2002, vol. 270, no. 1-2, pp. 677-700.
KUČERA, Antonín - MAYR, Richard.
Why is Simulation Harder Than Bisimulation?. In Proceedings of 13th International Conference on Concurrency Theory (CONCUR 2002). Berlin : Springer, 2002. ISBN 3-540-44043-7, pp. 594-609. 2002, August 20-23, 2002, Brno, Czech Republic.
JANČAR, Petr - KUČERA, Antonín - MAYR, Richard.
Deciding Bisimulation-Like Equivalences with Finite-State Processes. Theoretical Computer Science, Amsterdam, Nizozemí, The Nederlands. ISSN 0304-3975, 2001, vol. 258, no. 1-2, pp. 409-433.
ESPARZA, Javier - KUČERA, Antonín - SCHWOON, Stefan.
Model-Checking LTL with Regular Valuations for Pushdown Systems. In Proceedings of 4th International Symposium on Theoretical Aspects of Computer Software (TACS 2001). Berlin, Heidelberg, New York : Springer, 2001. ISBN 3-540-42736-8, pp. 316-340. October 2001, Sendai, Japan.
KUČERA, Antonín.
Effective Decomposability of Sequential Behaviours. Theoretical Computer Science, Amsterdam, Nizozemí, The Nederlands. ISSN 0304-3975, 2000, vol. 242, no. 1-2, pp. 71-89.
KUČERA, Antonín.
Efficient Verification Algorithms for One-Counter Processes. In Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP 2000). Berlin, Heidelberg, New York : Springer, 2000. ISBN 3-540-67715-1, pp. 317-328. July 2000, Geneva, Switzerland.
KUČERA, Antonín.
On Simulation-Checking with Sequential Systems. In Proceedings of 6th Asian Computing Science Conference (ASIAN 2000). Berlin, Heidelberg, New York : Springer, 2000. ISBN 3-540-41428-2, pp. 133-148. November 2000, Penang, Malaysia.
JANČAR, Petr - KUČERA, Antonín - MOLLER, Faron.
Simulation and Bisimulation over One-Counter Processes. In Proceedings of 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2000). Berlin, Heidelberg, New York : Springer, 2000. ISBN 3-540-67141-2, pp. 334-345. February 2000, Lille, France.
KUČERA, Antonín - ESPARZA, Javier.
A Logical Viewpoint on Process-Algebraic Quotients. In Computer Science Logic; Proceedings of 8th Annual Conference of the EACSL (CSL´99). Berlin : Springer, 1999. ISBN 3-540-66536-6, pp. 499-514. September 20-25, 1999, Madrid, Spain.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta informatica, Berlin, Springer-Verlag, Germany. ISSN 0001-5903, 1999, vol. 36, no. 3, pp. 233-256.
KUČERA, Antonín.
On Finite Representations of Infinite-State Behaviours. Information Processing Letters, Elsevier, The Nederlands. ISSN 0020-0190, 1999, vol. 70, no. 1, pp. 23-30.
KUČERA, Antonín.
Regularity of normed PA processes. Information Processing Letters, Elsevier, The Nederlands. ISSN 0020-0190, 1999, vol. 72, no. 1-2, pp. 9-17.
KUČERA, Antonín - MAYR, Richard.
Simulation Preorder on Simple Process Algebras. In Proceedings of 26th International Colloquium on Automata, Languages and Programming (ICALP'99). Berlin : Springer, 1999. ISBN 3-540-66224-3, pp. 503-512. July 1999, Prague, Czech Republic.
KUČERA, Antonín - RICHARD, Mayr.
Simulation Preorder on Simple Process Algebras. Technical Report TUM, Germany, Technical University Munich, Germany. 1999, vol. 1999, no. TUM-I9902, pp. 1-23.
KUČERA, Antonín - MAYR, Richard.
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. In Proceedings of 10th International Conference on Concurrency Theory (CONCUR´99). Berlin : Springer, 1999. ISBN 3-540-66425-4, pp. 368-382. August 24-27, 1999, Eindhoven, The Netherlands.
JANČAR, Petr - KUČERA, Antonín - MAYR, Richard.
Bisimilarity of Processes with Finite-State Systems. In Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP'98). Berlin : Springer, 1998. ISBN 3-540-64781-3, pp. 200-211. July 1998, Aalborg, Denmark.
JANČAR, Petr - KUČERA, Antonín - RICHARD, Mayr.
Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical Report TUM, Germany, Technical University Munich, Germany. 1998, vol. 1998, no. TUM-I9805, pp. 1-24.
KUČERA, Antonín - RICHARD, Mayr.
Weak Bisimilarity with Infinite-State Systems can be Decided in Polynomial Time. Technical Report TUM, Germany, Technical University Munich, Germany. 1998, vol. 1998, no. TUM-I9830, pp. 1-28.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. Electronic Notes in Theoretical Computer Science, Elsevier, The Nederlands. 1997, vol. 1997, no. 5, pp. 1-24.
JANČAR, Petr - KUČERA, Antonín.
Bisimilarity of Processes with Finite-state Systems. FI MU Report Series, Brno, FI MU. 1997, vol. 1997, no. RS-97-02, pp. 1-19.
JANČAR, Petr - KUČERA, Antonín.
Bisimilarity of Processes with Finite-State Systems. In Proceedings of 2nd International Workshop on Verification of Infinite State Systems (INFINITY´97). Uppsala (Sweden) : University of Uppsala, 1997. ISBN 1100-0686, pp. 72-85. July 11-12, 1997, Bologna, Italy.
JANČAR, Petr - KUČERA, Antonín.
Bisimilarity of Processes with Finite-State Systems. Electronic Notes in Theoretical Computer Science, Elsevier, The Nederlands. 1997, vol. 1997, no. 9, pp. 1-14.
KUČERA, Antonín.
How to Parallelize Sequential Processes. In Proceedings of 8th International Conference on Concurrency Theory (CONCUR´97). Berlin : Springer, 1997. ISBN 3-540-63141-0, pp. 302-316. July 1-4, 1997, Warsaw, Poland.
KUČERA, Antonín.
On Finite Representations of Infinite-State Behaviours. In Proceedings of 24th Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM'97). Berlin : Springer, 1997. ISBN 3-540-63774-5, pp. 481-488. November 22-29, 1997, Milovy, Czech Republic.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. In Proceedings of 1st International Workshop on Verification of Infinite State Systems (INFINITY'96). Passau : University of Passau, 1996. pp. 32-46. August 30-31, 1996, Pisa, Italy.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Comparing Expressibility of Normed BPA and Normed BPP Processes. FI MU Report Series, Brno, FI MU. 1996, vol. 1996, no. RS-96-02, pp. 1-28.
KUČERA, Antonín.
How to Parallelize Sequential Processes. FI MU Report Series, Brno, FI MU. 1996, vol. 1996, no. RS-96-05, pp. 1-24.
ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
On the Relationship between Sequential and Parallel Compositions in Process Algebras. In CSL96 - The 1996 Annual Conference of the European Assoc. Ultrech, The Netherlands : Department of Philosophy, Ulterech University, 1996. pp. 11-13.
KUČERA, Antonín.
Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. In Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96). Berlin : Springer, 1996. ISBN 3-540-61994-1, pp. 377-384. November 23-30, 1996, Milovy, Czech Republic.
KUČERA, Antonín.
Regularity is Decidable for Normed PA Processes in Polynomial Time. In Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS´96). Berlin : Springer, 1996. ISBN 3-540-62034-6, pp. 111-122. December 18-20, 1996, Hyderabad, India.
