appearance

MU › FI › About the faculty › People Search at MU › Personal page › Publications

Masaryk University - Faculty of Informatics

Skip navigation

Skip the Organizational structure panel
Organizational structure
On selecting a constituent part of MU the "Staff" page will be displayed with information relevant to the selected constituent part. The "Staff" page is not available for non-activated items.

Masaryk University
- Faculties
- Law
- Medicine
- Science
- Arts
- Education
- Economics
- Informatics
- Social Studies
- Sports Studies
- Institutes
- Computer Science
- CEITEC MU
- Politica
- Specialized Units
- Hostels & Canteens
- University Press
- Telč Centre
- UCB Management
- Rector`s Office
- Rectorate
- Other Units
- Archive
- Language Centre
- International Studies
- Disabled Students
- Technology Transfer
- Biostatistics
- Mendel Museum
- CERIT
- Civic Education
- Project Team CEITEC

Faculty of Informatics

Prof. RNDr. Mojmír Křetínský, CSc.

Basic CV Supervisor Qualifications Publications Projects Teaching

2012

LTL to Büchi Automata Translation: Fast and More Deterministic

BABIAK, Tomáš - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
LTL to Büchi Automata Translation: Fast and More Deterministic. In TACAS 2012: 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Berlin, Heidelberg : Springer-Verlag, 2012. ISBN 978-3-642-28755-8, pp. 95-109. 2012, Tallinn, Estonia.

2009

On Decidability of LTL Model Checking for Process Rewrite Systems

BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL Model Checking for Process Rewrite Systems. Acta informatica, Berlin, Springer-Verlag, Germany. ISSN 0001-5903, 2009, vol. 46, no. 1, pp. 1-28. DOI: 10.1007/s00236-008-0082-3.

On Decidability of LTL+Past Model Checking for Process Rewrite Systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL+Past Model Checking for Process Rewrite Systems. In Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY 2006, 2007, 2008). Vyd. 2009. Amsterdam, The Netherlands : Elsevier Science Publishers, 2009. pp. 105-117. 2007, Lisbon, Portugal.

Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008) - selected papers

ČEŠKA, Milan - KOTÁSEK, Zdeněk - KŘETÍNSKÝ, Mojmír - MATYSKA, Luděk - VOJNAR, Tomáš.
Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008) - selected papers. Electronic Notes in Theoretical Computer Science, Amsterdam, The Netherlands, Elsevier B.V. ISSN 1571-0661, 2009, vol. 251, 96 pp.

Reachability is decidable for weakly extended process rewrite systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Reachability is decidable for weakly extended process rewrite systems. Information and Computation, Elsevier, The Nederlands. ISSN 0890-5401, 2009, vol. 207, no. 6, pp. 671-680.

2008

MEMICS 2008, Fourth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

ČEŠKA, Milan - KOTÁSEK, Zdeněk - KŘETÍNSKÝ, Mojmír - MATYSKA, Luděk - VOJNAR, Tomáš - ANTOŠ, David (Eds.).
MEMICS 2008, Fourth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Vyd. 1. Brno : Ing. Zdeněk Novotný CSc., Ondráčkova 105, 628 00 Brno, 2008. 286 pp. ISBN 978-80-7355-082-0.

MEMICS 2008, Fourth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

ČEŠKA, Milan - KOTÁSEK, Zdeněk - KŘETÍNSKÝ, Mojmír - MATYSKA, Luděk - VOJNAR, Tomáš - ANTOŠ, David.
MEMICS 2008, Fourth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. 2008. CZE, Znojmo. 14.11.2008 - 16.11.2008, Worldwide Activity.

Petri Nets Are Less Expressive Than State-Extended PA

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Petri Nets Are Less Expressive Than State-Extended PA. Theoretical Computer Science, Amsterdam, North Holland, Elsevier Science Publishers, The Nederlands. ISSN 0304-3975, 2008, vol. 394, no. 1-2, pp. 134-140. DOI 10.1016/j.tcs.2007.12.003.

2007

MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

MATYSKA, Luděk - ANTOŠ, David - ČEŠKA, Milan - KŘETÍNSKÝ, Mojmír - HLINĚNÝ, Petr (Eds.).
MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Vyd. 1. Brno : Ing. Zdeněk Novotný CSc., Ondráčkova 105, 62800 Brno, 2007. 290 pp. ISBN 978-80-7355-077-6.

MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science

MATYSKA, Luděk - ANTOŠ, David - ČEŠKA, Milan - KŘETÍNSKÝ, Mojmír - HLINĚNÝ, Petr.
MEMICS 2007: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. 2007. CZE, Znojmo. 26.10.2007 - 28.10.2007, Worldwide Activity.

Model Checking Large Finite-State Systems and Beyond

BRIM, Luboš - KŘETÍNSKÝ, Mojmír.
Model Checking Large Finite-State Systems and Beyond. In 33rd Conference on Current Trends in Theory and Practice of Computer Science. Berlin : Springer-Verlag, 2007. ISBN 978-3-540-69506-6, pp. 9-28. 2007, Harrachov.

On Decidability of LTL+Past Model Checking for Process Rewrite Systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL+Past Model Checking for Process Rewrite Systems. 2007.

2006

Formální jazyky a automaty I

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

Formální jazyky a automaty I

ČERNÁ, Ivana - KŘETÍNSKÝ, Mojmír - KUČERA, Antonín.
Formální jazyky a automaty I. Brno : Masarykova univerzita, 2006. 159 pp. Elportal.

On Decidability of LTL Model Checking for Process Rewrite Systems

BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
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. ISBN 978-3-540-49994-7, pp. 248-259. 2006, Kolkata, India. Lecture Notes in Computer Science 4337.

On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems

BOZZELLI, Laura - KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Decidability of LTL Model Checking for Weakly Extended Process Rewrite Systems. Brno : FI MU, 2006. FIMU-RS-2006-05. full and extended version of FST&TCS'06 paper. link to a new window WWW

Refining Undecidability Border of Weak Bisimilarity.

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Refining Undecidability Border of Weak Bisimilarity. In Proceedings of the 7th International Workshop on Verification of Infinite-State Systems (INFINITY'05). Vyd. 2006. Amsterdam, The Netherlands : Elsevier Science, 2006. pp. 17-36. 2005, San Francisco, USA. modified and extended version of INFINITY 2005 paper.

2005

Reachability of Hennessy - Milner properties for weakly extended PRS

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Reachability of Hennessy - Milner properties for weakly extended PRS. In FSTTCS 2005: 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, 25th International Conference. Berlin, Heidelberg : Springer-Verlag, 2005. ISBN 3-540-30495-9, pp. 213-224. 2005, Hyderabad, India.

Refining Undecidability Border of Weak Bisimilarity.

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Refining Undecidability Border of Weak Bisimilarity. BRICS Notes Series, San Francisco, USA, . ISSN 0909-3206, 2005, vol. 2005, no. NS-05-4, pp. 3-14.

Refining Undecidability Border of Weak Bisimilarity. (full version of INFINITY 2005 paper)

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Refining Undecidability Border of Weak Bisimilarity. (full version of INFINITY 2005 paper). Brno : FI MU, 2005. FIMU-RS-2005-06. link to a new window WWW

2004

Extended Process Rewrite Systems: Expressiveness and Reachability

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Extended Process Rewrite Systems: Expressiveness and Reachability. In CONCUR 2004 - Concurrency Theory. Vyd. LNCS 3170. Berlin, Heidelberg, New York : Springer, 2004. ISBN 3-540-22940-X, pp. 355-370. 2004, London, UK.

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. In INFINITY'2003: 5th International Workshop on Verification of Infinite-State Systems. Vyd. 2004. Amsterdam, The Netherlands : Elsevier Science, 2004. pp. 75-88. 2003, Marseilles, France.

On the Expressive Power of Extended Process Rewrite Systems

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On the Expressive Power of Extended Process Rewrite Systems. BRICS Report Series, Aarhus, Basic Research in Computer Science. ISSN 0909-0878, 2004, vol. 2004, no. RS-04-7, pp. 1-18.

2003

Coordination by means of Synchronous and Asynchronous Communication in Concurrent constraint Programming

BRIM, Luboš - JACQUET, Jean-Marie - GILBERT, David - KŘETÍNSKÝ, Mojmír.
Coordination by means of Synchronous and Asynchronous Communication in Concurrent constraint Programming. Electronic Notes in Theoretical Computer Science, Amsterdam, Elsevier Science. ISSN 0444514163, 2003, vol. 68, no. 3, pp. 1-24.

Modelling Multi-Agents Systems as Concurrent Constraint Processes

BRIM, Luboš - JACQUET, Jean-Marie - GILBERT, David - KŘETÍNSKÝ, Mojmír.
Modelling Multi-Agents Systems as Concurrent Constraint Processes. Computing and Informatics, Slovakia. ISSN 1335-9150, 2003, vol. 21, no. 6, pp. 565-590.

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. In Prelim.Proc.of the 5th Internat.Workshop on Verification of Infinite-State Systems (INFINITY'2003). Marseille, France : Universite de Provence, Marseille, 2003. pp. 73-86. 2003, Marseille.

Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper)

KŘETÍNSKÝ, Mojmír - ŘEHÁK, Vojtěch - STREJČEK, Jan.
Process Rewrite Systems with Weak Finite-State Unit (full version of INFINITY'2003 paper). Brno : FI MU, 2003. 23 pp. FIMU-RS-2003-05.

2002

CONCUR 2002 - Concurrency Theory. 13th International Conference.

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.

CONCUR 2002 - Concurrency Theory. 13th International Conference. Proceedings.

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.

Coordination by means of Synchronous and Asynchronous Communication in Concurrent constraint Programming

BRIM, Luboš - JACQUET, Jean-Marie - GILBERT, David - KŘETÍNSKÝ, Mojmír.
Coordination by means of Synchronous and Asynchronous Communication in Concurrent constraint Programming. In Foundations of Coordination Languages and Software Architecture (FOCLASA`02). Amsterdam : Namur University, 2002. pp. 1-24. 2002, August 2002, Brno.

2001

Multi-Agents Systems as Concurrent Constraint Processes

BRIM, Luboš - JACQUET, Jean-Marie - GILBERT, David - KŘETÍNSKÝ, Mojmír.
Multi-Agents Systems as Concurrent Constraint Processes. In SOFSEM 2001 28th Conf.on Current Trends in Theory and Practice of Informatics. Heldelberg : Springer Verlag, 2001. ISBN 0302-9743, pp. 201-210. November 2001, Piestany.

1999

A Fully Abstract Semantics for a Version of Synchronous Concurrent Constraint Programming

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, vol. 1999, no. 08, pp. 1-62.

Comparing Expressibility of Normed BPA and Normed BPP Processes.

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

1998

A fully abstract semantics for synchronous and asynchronous ccp

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, Belgium. 1998, vol. 1998, no. 1, pp. 1-48.

MFCS´98 Workshop on Concurrency, August_27-29,_1998, Brno, Czech Republic : pre-proceedings

JANČAR, Petr - KŘETÍNSKÝ, Mojmír.
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, pp. 1-209.

Proceedings of the MFCS'98 Workshop on Concurrency

JANČAR, Petr - KŘETÍNSKÝ, Mojmír.
Proceedings of the MFCS'98 Workshop on Concurrency. Electronic Notes in Theoretical Computer Science, Elsevier, The Nederlands. 1998, vol. 1998, no. Vol.18, pp. 1-200.

1997

Adding Time via Timed Transitions to Concurrent Constraint Programming

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. pp. 23-34.

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

Temporal Synchronous Concurrent Constraint Programming

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. tical appl, pp. 35-50.

1996

A process algebra for Synchronous Concurrent Constraint Programming

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. LNCS 1139, ISBN 3-540-61735-3, pp. 165-178.

A process Algebra for Synchronous Concurrent Constraint Programming

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, Great Britain. ISSN 1364-4009, 1996, vol. 1996, no. 6, pp. 1-15.

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

Comparing Expressibility of Normed BPA and Normed BPP Processes

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

New versions of asks for synchronous communication in concurrent constraint programming

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, Great Britain. ISSN 1364-4009, 1996, vol. 1996, no. 3, pp. 1-22.

On the Relationship between Sequential and Parallel Compositions in Process Algebras

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

1995

A process algebra for Synchronous Concurrent Constraint Programming

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, Belgium. 1995, vol. 1995, no. 8, pp. 1-15. (A full version of a conference paper).

New versions of Ask and Tell for synchronous communication in CCP

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, Great Britain. ISSN 1364-4009, 1995, vol. 1995, no. 10, pp. 1-18.

Synchronisation in Scc

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. ISBN 0-262-62099-5, pp. 282-283.

1994

On Synchronous Communication in Concurrent Constraint Programming

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, Belgium. 1994, vol. 1994, no. prelim.rep, pp. 1-25.

1993

Operational semantics of concurrent logical systems.

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. pp. 13-18.

top