Publications, grant no. GACR 201/93/2123
Analysis of concurrent 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, Lubos - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. A process algebra for Synchronous Concurrent Constraint Programming. In ALP96: Fifth Int. Conference on Algebraic and Logic Programm. Aachen, Germany : Springer-Verlag, 1996., s. 165-178. LNCS 1139. ISBN 3-540-61735-3.
  2. Brim, Lubos - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. A process algebra for Synchronous Concurrent Constraint Programming. Technical Report of Namur University, Namur : Namur University, 1995, 8, s. 1-15. 1995. (A full version of a conference paper).
  3. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. A process Algebra for Synchronous Concurrent Constraint Programming. TR City University, U.K., London : City University London, 1996, 6, s. 1-15. ISSN 1364-4009. 1996.
  4. Černá, Ivana - Křetínský, Mojmír - Kučera, Antonín. Bisimilarity is Decidable in the Union of Normed BPA and Normed BPP Processes. B. Steffen, T. Margaria (Eds.). In Proceedings of 1st International Workshop on Verification of Infinite State Systems (INFINITY'96). Passau : University of Passau, 1996., s. 32-46. MIP-9614.
  5. Č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, RS-96-02, s. 1-28. 1996.
  6. Kučera, Antonín. Deciding Regularity in Process Algebras. BRICS Report Series, Denmark : BRICS, 1995, RS-95-52, s. 1-42. 1995.
  7. Brim, Luboš. Modal mu-Calculus with Distances. Scripta Fac.Brun., 1994, 23, s. 51-63. ISSN 2101-2986. 1994.
  8. Brim, Lubos - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. New versions of Ask and Tell for synchronous communication in CCP. TR City University, U.K., London : City University London, 1995, 10, s. 1-18. ISSN 1364-4009. 1995.
  9. Brim, Lubos - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. New versions of asks for synchronous communication in concurrent constraint programming. TR City University, U.K., London : City University London, 1996, 3, s. 1-22. ISSN 1364-4009. 1996.
  10. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. On Synchronous Communication in Concurrent Constraint Programming. Technical Report of Namur University, Namur : Namur University, 1994, prelim.rep, s. 1-25. 1994.
  11. Černá, Ivana - Křetínský, Mojmír - Kučera, Antonín. On the Relationship between Sequential and Parallel Compositions in Process Algebras. In CSL´96 - The 1996 Annaval Conference of the European Assoc.. Ultrech, The Netherlands : Department of Philosophy, Ulterech University, 1996., s. 11-13.
  12. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. Operational semantics of concurrent logical systems. In ALP-UK Workshop on Cocurrency in Computational Logic. London,U.K. : City University London, 1993., s. 13-18.
  13. Kučera, Antonín. Regularity is Decidable for Normed BPA and Normed BPP Processes in Polynomial Time. K.G. Jeffery, J. Král, M. Bartošek (Eds.). In Proceedings of 23rd Seminar on Current Trends in Theory and Practice of Informatics (SOFSEM´96). Berlin : Springer, 1996., s. 377-384. Lecture Notes in Computer Science, vol. 1175. ISBN 3-540-61994-1.
  14. 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.
  15. Kučera, Antonín. Regularity is Decidable for Normed PA Processes in Polynomial Time. FI MU Report Series, Brno : FI MU, 1996, RS-96-01, s. 1-17. 1996.
  16. Brim, Luboš - Gilbert, David - Jacquet, Jean-Marie - Křetínský, Mojmír. Synchronisation in Scc. In ILPS´95. Portland, Oregon, U.S.A : MIT Press, 1995., s. 282-283. ISBN 0-262-62099-5.