Prof. RNDr. Petr Jančar, CSc.
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 - 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.
JANČAR, Petr - SRBA, Jiří.
Undecidability Results for Bisimilarity on Prefix Rewrite Systems. LNCS, Foundations of Software Science and Computation Structures (FOSSACS'06), Netherlands, Spinger-Verlag, The Nederlands. 2006, vol. 2006, no. 3921, pp. 277-291.
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.
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.
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.
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.
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.
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.
