Synchronisation in Scc. - Lubos Brim; David R. Gilbert; Jean-Marie Jacquet; Mojmír Kretínský (ILPS, 1995)

A Process Algebra for Synchronous Concurrent Constraint Programming. - Lubos Brim; Jean-Marie Jacquet; David R. Gilbert; Mojmír Kretínský (ALP, 1996)

Bisimilarity is decidable in the union of normed BPA and normed BPP processes. - Ivana Cerná; Mojmír Kretínský; Antonín Kucera 001 (INFINITY, 1996)

Preface. - Petr Jancar; Mojmír Kretínský (MFCS Workshop on Concurrency, 1998)

Comparing Expressibility of Normed BPA and Normed BPP Processes. - Ivana Cerná; Mojmír Kretínský; Antonín Kucera 001 (Acta Informatica, 1999)

Multi-agent Systems as Concurrent Constraint Processes. - Lubos Brim; David R. Gilbert; Jean-Marie Jacquet; Mojmír Kretínský (SOFSEM, 2001)

Modelling Multi-Agent Systems as Synchronous Concurrent Constraint Processes. - Lubos Brim; Mojmír Kretínský; Jean-Marie Jacquet; David R. Gilbert (Comput. Artif. Intell., 2002)

Coordination by Means of Synchronous and Asynchronous Communication in Concurrent Constraint Programming. - Jean-Marie Jacquet; Lubos Brim; David R. Gilbert; Mojmír Kretínský (FOCLASA, 2002)

On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (INFINITY, 2003)

Extended Process Rewrite Systems: Expressiveness and Reachability. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (CONCUR, 2004)

Reachability of Hennessy-Milner Properties for Weakly Extended PRS. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (FSTTCS, 2005)

Refining the Undecidability Border of Weak Bisimilarity. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (INFINITY, 2005)

Model-Checking Large Finite-State Systems and Beyond. - Lubos Brim; Mojmír Kretínský (SOFSEM (1), 2007)

Preface. - Milan Ceska 002; Zdenek Kotásek; Mojmír Kretínský; Ludek Matyska; Tomás Vojnar (MEMICS, 2008)

Petri nets are less expressive than state-extended PA. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (Theor. Comput. Sci., 2008)

On decidability of LTL model checking for process rewrite systems. - Laura Bozzelli; Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (Acta Informatica, 2009)

On Decidability of LTL+Past Model Checking for Process Rewrite Systems. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (INFINITY, 2009)

Reachability is decidable for weakly extended process rewrite systems. - Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (Inf. Comput., 2009)

A Short Story of a Subtle Error in LTL Formulas Reduction and Divine Incorrectness - Tomás Babiak; Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (CoRR, 2010)

LTL to Büchi Automata Translation: Fast and More Deterministic. - Tomás Babiak; Mojmír Kretínský; Vojtech Rehák; Jan Strejcek (TACAS, 2012)

Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment. - Tomás Babiak; Frantisek Blahoudek; Mojmír Kretínský; Jan Strejcek (ATVA, 2013)

Comparison of LTL to Deterministic Rabin Automata Translators. - Frantisek Blahoudek; Mojmír Kretínský; Jan Strejcek (LPAR, 2013)

Compositional Approach to Suspension and Other Improvements to LTL Translation. - Tomás Babiak; Thomas Badie; Alexandre Duret-Lutz; Mojmír Kretínský; Jan Strejcek (SPIN, 2013)

Is there a best büchi automaton for explicit model checking? - Frantisek Blahoudek; Alexandre Duret-Lutz; Mojmír Kretínský; Jan Strejcek (SPIN, 2014)

Seminator: A Tool for Semi-Determinization of Omega-Automata. - Frantisek Blahoudek; Alexandre Duret-Lutz; Mikulás Klokocka; Mojmír Kretínský; Jan Strejcek (LPAR, 2017)