Mojmír Kretínský

According to our database1, Mojmír Kretínský
  • authored at least 28 papers between 1995 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Seminator: A Tool for Semi-Determinization of Omega-Automata.
Proceedings of the LPAR-21, 2017

2014
Is there a best büchi automaton for explicit model checking?
Proceedings of the 2014 International Symposium on Model Checking of Software, 2014

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

Compositional Approach to Suspension and Other Improvements to LTL Translation.
Proceedings of the Model Checking Software - 20th International Symposium, 2013

Comparison of LTL to Deterministic Rabin Automata Translators.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment.
Proceedings of the Automated Technology for Verification and Analysis, 2013

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

LTL to Büchi Automata Translation: Fast and More Deterministic.
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
CoRR, 2010

2009
Reachability is decidable for weakly extended process rewrite systems.
Inf. Comput., 2009

On Decidability of LTL+Past Model Checking for Process Rewrite Systems.
Electr. Notes Theor. Comput. Sci., 2009

Preface.
Electr. Notes Theor. Comput. Sci., 2009

On decidability of LTL model checking for process rewrite systems.
Acta Inf., 2009

2008
Petri nets are less expressive than state-extended PA.
Theor. Comput. Sci., 2008

2007
Model-Checking Large Finite-State Systems and Beyond.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006
Refining the Undecidability Border of Weak Bisimilarity.
Electr. Notes Theor. Comput. Sci., 2006

On Decidability of LTL Model Checking for Process Rewrite Systems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

2005
Reachability of Hennessy-Milner Properties for Weakly Extended PRS.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit.
Electr. Notes Theor. Comput. Sci., 2004

Extended Process Rewrite Systems: Expressiveness and Reachability.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Coordination by Means of Synchronous and Asynchronous Communication in Concurrent Constraint Programming.
Electr. Notes Theor. Comput. Sci., 2003

2002
Modelling Multi-Agent Systems as Synchronous Concurrent Constraint Processes.
Computers and Artificial Intelligence, 2002

2001
Multi-agent Systems as Concurrent Constraint Processes.
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.
Acta Inf., 1999

1998
Preface.
Electr. Notes Theor. Comput. Sci., 1998

1996
Bisimilarity is decidable in the union of normed BPA and normed BPP processes.
Electr. Notes Theor. Comput. Sci., 1996

A Process Algebra for Synchronous Concurrent Constraint Programming.
Proceedings of the Algebraic and Logic Programming, 5th International Conference, 1996

1995
Synchronisation in Scc.
Proceedings of the Logic Programming, 1995


  Loading...