Publications, grant no. GACR 201/97/0456
Algorithmic verification boundaries for infinite-state systems

Note: listed are only those publications where at least one co-author is a member of team at FI MU
  1. Brim, Luboš - Jacquet, Jean-Marie - Gilbert, David - Křetínský, Mojmír. A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming. FI MU Report Series, Brno : FI MU, 1999, 08, s. 1-62. 1999. URL
  2. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. A fully abstract semantics for synchronous and asynchronous ccp. Technical Report of Namur University, Namur : Namur University, 1998, 1, s. 1-48. 1998.
  3. Kučera, Antonín - Esparza, Javier. 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., s. 499-514. Lecture Notes in Computer Science, vol. 1683. ISBN 3-540-66536-6.
  4. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. Adding Time via Timed Transitions to Concurrent Constraint Programming. In ERCIM/COMPULOG Workshop. Linz, Austria : ERCIM, 1997., s. 23-34.
  5. Č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, 1997, 5, s. 1-24. 1997. ENTCS home page
  6. Jančar, Petr - Kučera, Antonín. Bisimilarity of Processes with Finite-state Systems. FI MU Report Series, Brno : FI MU, 1997, RS-97-02, s. 1-19. 1997.
  7. Jančar, Petr - Kučera, Antonín - Mayr, Richard. 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., s. 200-211. Lecture Notes in Computer Science, vol. 1443. ISBN 3-540-64781-3.
  8. Jančar, Petr - Kučera, Antonín. 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., s. 72-85. UPMAIL TR No. 148. ISBN 1100-0686.
  9. Jančar, Petr - Kučera, Antonín. Bisimilarity of Processes with Finite-State Systems. Electronic Notes in Theoretical Computer Science, Elsevier, 1997, 9, s. 1-14. 1997. ENTCS home page
  10. Č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, 36, 3, s. 233-256. ISSN 0001-5903. 1999.
  11. Srba, Jiří. Comparing the Classes BPA and BPA with Deadlocks. Technical report, Faculty of Informatics, Masaryk University, Brno, 1998, 05, s. 1-36. ISSN FIMU-RS-98-05. 1998. URL
  12. Klíma, Ondřej - Srba, Jiří. Complexity Issues of the Pattern Equations in Idempotent Semigroups. Technical Report, Faculty of Informatics, Masaryk University, Brno, 1999, 02, s. 1-14. ISSN FIMU-RS-99-02. 1999. URL
  13. Srba, Jiří. Deadlocking States in Context-Free Process Algebra. In Proceedings of the The 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98). Heidelberg : Springer-Verlag, 1998., s. 388-397. volume 1450 of LNCS. URL
  14. Jančar, Petr - Kučera, Antonín - Richard, Mayr. Deciding Bisimulation-Like Equivalences with Finite-State Processes. Technical Report TUM, Germany : Technical University Munich, 1998, TUM-I9805, s. 1-24. 1998.
  15. 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., s. 302-316. Lecture Notes in Computer Science, vol. 1243. ISBN 3-540-63141-0.
  16. Brim, Luboš - Gruska, Jozef - Zlatuška, Jiří. Mathematical Foundations of Computer Science 1998. Heidelberg : Springer Verlag, 1998. 846 s. Lecture Notes in Computer Science, Vol. 1450. ISBN 3-540-64827-5.
  17. Jančar, Petr - Křetínský, Mojmír (eds.). MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings. FI MU Report Series, Brno : FI MU, 1998, 06, s. 1-209. 1998.
  18. 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., s. 481-488. Lecture Notes in Computer Science, vol. 1338. ISBN 3-540-63774-5.
  19. Černá, Ivana - Klíma, Ondřej - Srba, Jiří. On the Pattern Equations. Technical Report, Faculty of Informatics, Masaryk University, Brno, 1999, 01, s. 1-11. ISSN FIMU-RS-99-01. 1999. URL
  20. Černá, Ivana - Srba, Jiří - Klíma, Ondřej. Pattern Equations and Equations with Stuttering. In SOFSEM'99: Theory and Practise of Informatics. Heidelberg : Springer, 1999., s. 369-378. Lecture Notes in Computer Science 1725. ISBN 3-540-66694-X.
  21. Jančar, Petr - Křetínský, Mojmír(eds.). Proceedings of the MFCS'98 Workshop on Concurrency. Electronic Notes in Theoretical Computer Science, Elsevier, 1998, Vol.18, s. 1-200. 1998. ENTCS home page
  22. Kučera, Antonín. Regularity of normed PA processes. Information Processing Letters, Elsevier, 72, 1-2, s. 9-17. ISSN 0020-0190. 1999.
  23. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. Temporal Synchronous Concurrent Constraint Programming. In COTIC 97, 1st Int.Workshop on Contr.programming for time critical systems. Piza, Italy : COTIC 97, 1997., s. 35-50.