default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMojmír Kretínský
Person information
- affiliation: Masaryk University, Brno, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c20]Frantisek Blahoudek, Alexandre Duret-Lutz, Mikulás Klokocka, Mojmír Kretínský, Jan Strejcek:
Seminator: A Tool for Semi-Determinization of Omega-Automata. LPAR 2017: 356-367- 2014
- [c19]Frantisek Blahoudek
, Alexandre Duret-Lutz, Mojmír Kretínský, Jan Strejcek:
Is there a best büchi automaton for explicit model checking? SPIN 2014: 68-76 - 2013
- [c18]Tomás Babiak, Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek:
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment. ATVA 2013: 24-39 - [c17]Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek:
Comparison of LTL to Deterministic Rabin Automata Translators. LPAR 2013: 164-172 - [c16]Tomás Babiak, Thomas Badie, Alexandre Duret-Lutz, Mojmír Kretínský, Jan Strejcek:
Compositional Approach to Suspension and Other Improvements to LTL Translation. SPIN 2013: 81-98 - [i3]Tomás Babiak, Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek:
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F, G)-Fragment. CoRR abs/1306.4636 (2013) - 2012
- [c15]Tomás Babiak, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
LTL to Büchi Automata Translation: Fast and More Deterministic. TACAS 2012: 95-109 - [i2]Tomás Babiak, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
LTL to Büchi Automata Translation: Fast and More Deterministic. CoRR abs/1201.0682 (2012) - 2010
- [i1]Tomás Babiak, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
A Short Story of a Subtle Error in LTL Formulas Reduction and Divine Incorrectness. CoRR abs/1011.4214 (2010)
2000 – 2009
- 2009
- [j5]Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On decidability of LTL model checking for process rewrite systems. Acta Informatica 46(1): 1-28 (2009) - [j4]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Reachability is decidable for weakly extended process rewrite systems. Inf. Comput. 207(6): 671-680 (2009) - [c14]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On Decidability of LTL+Past Model Checking for Process Rewrite Systems. INFINITY 2009: 105-117 - [e3]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, MEMICS 2008, Znojmo, Czech Republic, November 14-16, 2008. Electronic Notes in Theoretical Computer Science 251, Elsevier 2009 [contents] - 2008
- [j3]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Petri nets are less expressive than state-extended PA. Theor. Comput. Sci. 394(1-2): 134-140 (2008) - [c13]Milan Ceska, Zdenek Kotásek, Mojmír Kretínský, Ludek Matyska, Tomás Vojnar:
Preface. MEMICS 2008: 1-3 - 2007
- [c12]Lubos Brim, Mojmír Kretínský:
Model-Checking Large Finite-State Systems and Beyond. SOFSEM (1) 2007: 9-28 - 2006
- [c11]Laura Bozzelli, Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On Decidability of LTL Model Checking for Process Rewrite Systems. FSTTCS 2006: 248-259 - 2005
- [c10]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Reachability of Hennessy-Milner Properties for Weakly Extended PRS. FSTTCS 2005: 213-224 - [c9]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Refining the Undecidability Border of Weak Bisimilarity. INFINITY 2005: 17-36 - 2004
- [c8]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
Extended Process Rewrite Systems: Expressiveness and Reachability. CONCUR 2004: 355-370 - 2003
- [c7]Mojmír Kretínský, Vojtech Rehák, Jan Strejcek:
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit. INFINITY 2003: 75-88 - 2002
- [j2]Lubos Brim, Mojmír Kretínský, Jean-Marie Jacquet, David R. Gilbert:
Modelling Multi-Agent Systems as Synchronous Concurrent Constraint Processes. Comput. Artif. Intell. 21(6): 565-590 (2002) - [c6]Jean-Marie Jacquet, Lubos Brim, David R. Gilbert, Mojmír Kretínský:
Coordination by Means of Synchronous and Asynchronous Communication in Concurrent Constraint Programming. FOCLASA 2002: 347-370 - [e2]Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera:
CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings. Lecture Notes in Computer Science 2421, Springer 2002, ISBN 3-540-44043-7 [contents] - 2001
- [c5]Lubos Brim, David R. Gilbert, Jean-Marie Jacquet, Mojmír Kretínský:
Multi-agent Systems as Concurrent Constraint Processes. SOFSEM 2001: 201-210
1990 – 1999
- 1999
- [j1]Ivana Cerná, Mojmír Kretínský, Antonín Kucera:
Comparing Expressibility of Normed BPA and Normed BPP Processes. Acta Informatica 36(3): 233-256 (1999) - 1998
- [c4]Petr Jancar, Mojmír Kretínský:
Preface. MFCS Workshop on Concurrency 1998: 1-2 - [e1]Petr Jancar, Mojmír Kretínský:
Proceedings of the MFCS '98 Workshop on Concurrency, Brno, Czech Republic, August 27-29, 1998. Electronic Notes in Theoretical Computer Science 18, Elsevier 1998 [contents] - 1996
- [c3]Lubos Brim, Jean-Marie Jacquet, David R. Gilbert, Mojmír Kretínský:
A Process Algebra for Synchronous Concurrent Constraint Programming. ALP 1996: 165-178 - [c2]Ivana Cerná, Mojmír Kretínský, Antonín Kucera:
Bisimilarity is decidable in the union of normed BPA and normed BPP processes. INFINITY 1996: 14 - 1995
- [c1]Lubos Brim, David R. Gilbert, Jean-Marie Jacquet, Mojmír Kretínský:
Synchronisation in Scc. ILPS 1995: 641
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:25 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
