Mojmír Kretínský

According to our database, Mojmír Kretínský authored at least 25 papers between 1995 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2017

Seminator: A Tool for Semi-Determinization of Omega-Automata.

Frantisek Blahoudek, Alexandre Duret-Lutz, Mikulás Klokocka, Mojmír Kretínský, Jan Strejcek

Proceedings of the LPAR-21, 2017

2014

Is there a best büchi automaton for explicit model checking?

Frantisek Blahoudek, Alexandre Duret-Lutz, Mojmír Kretínský, Jan Strejcek

Proceedings of the 2014 International Symposium on Model Checking of Software, 2014

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

Proceedings of the Model Checking Software - 20th International Symposium, 2013

Comparison of LTL to Deterministic Rabin Automata Translators.

Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment.

Tomás Babiak, Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

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

Tomás Babiak, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

2010

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

2009

Reachability is decidable for weakly extended process rewrite systems.

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Inf. Comput., 2009

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

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Proceedings of the Joint Proceedings of the 8th, 2009

On decidability of LTL model checking for process rewrite systems.

Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Acta Informatica, 2009

2008

Petri nets are less expressive than state-extended PA.

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Theor. Comput. Sci., 2008

Preface.

Milan Ceska, Zdenek Kotásek, Mojmír Kretínský, Ludek Matyska, Tomás Vojnar

Proceedings of the International Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2008

2007

Model-Checking Large Finite-State Systems and Beyond.

Lubos Brim, Mojmír Kretínský

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2005

Refining the Undecidability Border of Weak Bisimilarity.

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Proceedings of the 7th International Workshop on Verification of Infinite-State Systems, 2005

Reachability of Hennessy-Milner Properties for Weakly Extended PRS.

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

Extended Process Rewrite Systems: Expressiveness and Reachability.

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003

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

Mojmír Kretínský, Vojtech Rehák, Jan Strejcek

Proceedings of INFINITY 2003, 2003

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ý

Proceedings of the Foundations of Coordination Languages and Software Architectures, 2002

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

2001

Multi-agent Systems as Concurrent Constraint Processes.

Lubos Brim, David R. Gilbert, Jean-Marie Jacquet, Mojmír Kretínský

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

1999

Comparing Expressibility of Normed BPA and Normed BPP Processes.

Ivana Cerná, Mojmír Kretínský, Antonín Kucera

Acta Informatica, 1999

1998

Preface.

Petr Jancar, Mojmír Kretínský

Proceedings of the MFCS '98 Workshop on Concurrency, 1998

1996

Bisimilarity is decidable in the union of normed BPA and normed BPP processes.

Ivana Cerná, Mojmír Kretínský, Antonín Kucera

Proceedings of the First International Workshop on Verification of Infinite State Systems, 1996

A Process Algebra for Synchronous Concurrent Constraint Programming.

Lubos Brim, Jean-Marie Jacquet, David R. Gilbert, Mojmír Kretínský

Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

1995

Synchronisation in Scc.

Lubos Brim, David R. Gilbert, Jean-Marie Jacquet, Mojmír Kretínský

Proceedings of the Logic Programming, 1995