Publication Records

BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Process Rewrite Systems. Acta informatica. Berlin: Springer-Verlag, 2009, vol. 46, No 1, p. 1-28. ISSN 0001-5903.

BRÁZDIL, Tomáš, Antonín KUČERA and Oldřich STRAŽOVSKÝ. Deciding probabilistic bisimilarity over infinite-state probabilistic systems. Acta informatica. Berlin: Springer-Verlag, 2008, vol. 45, No 2, p. 131-154. ISSN 0001-5903.

VAŘEKOVÁ, Pavlína, Barbora ZIMMEROVÁ, Pavel MORAVEC and Ivana ČERNÁ. Formal verification of systems with an unlimited number of components. IET Software journal. Inst. of Engeneering and Technology, 2008, Volume 2, Isuue 6, p. p. 532-546, 15 pp. ISSN 1751-8806.

BOUAJJANI, Ahmed, Jan STREJČEK and Tayssir TOUILI. On Symbolic Verification of Weakly Extended PAD. In Proceedings of the 13th International Workshop on Expressiveness in Concurrency (EXPRESS 2006). Neuveden: Elsevier, 2007, p. 47-64. ISSN 1571-0661.

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.

KUČERA, Antonín and Petr JANČAR. Equivalence-Checking on Infinite-State Systems: Techniques and Results. Theory and practice of logic programming. Cambridge: Cambridge University Press, 2006, vol. 6, No 3, p. 227-264. ISSN 1471-0684.

BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Process Rewrite Systems. In FSTTCS 2006: 26th International Conference on Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings. Berlin: Springer-Verlag, 2006, p. 248-259. ISBN 978-3-540-49994-7.

BOZZELLI, Laura, Mojmír KŘETÍNSKÝ, Vojtěch ŘEHÁK and Jan STREJČEK. On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems. Brno: FI MU, 2006. FIMU-RS-2006-05.

BOUAJJANI, Ahmed, Jan STREJČEK and Tayssir TOUILI. On Symbolic Verification of Weakly Extended PAD. In Preliminary Proceedings - 13th International Workshow on Expressiveness in Concurrency - EXPRESS'06. London: Imperial College London, 2006, p. 29-41.

KUČERA, Antonín and Philippe SCHNOEBELEN. A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications. P. Gardner, N. Yoshida (Eds.). In Proceedings of 15th International Conference on Concurrency Theory (CONCUR 2004). Berlin: Springer, 2004, p. 371-386. ISBN 3-540-22940-X.

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 and Petr JANČAR. Equivalence-Checking with Infinite-State Systems: Techniques and Results. W.I. Grosky, F. Plášil (Eds.). In Proceedings of 29th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2002). Berlin: Springer, 2002, p. 41-73. ISBN 3-540-00145-X.

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. 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 and Richard MAYR. INFINITY 2002. 4th International Workshop on Verification of Infinite-State Systems. 2002.

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

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