default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrantisek Blahoudek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j3]Frantisek Blahoudek
, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Efficient Strategy Synthesis for MDPs With Resource Constraints. IEEE Trans. Autom. Control. 68(8): 4586-4601 (2023)- [c14]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Word Equations in Synergy with Regular Constraints. FM 2023: 403-423 - 2022
- [j2]Murat Cubuktepe, Frantisek Blahoudek, Ufuk Topcu:
Polynomial-Time Algorithms for Multiagent Minimal-Capacity Planning. IEEE Trans. Control. Netw. Syst. 9(3): 1327-1338 (2022) - [i6]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Word Equations in Synergy with Regular Constraints (Technical Report). CoRR abs/2212.02317 (2022) - 2021
- [c13]Frantisek Blahoudek, Murat Cubuktepe, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Fuel in Markov Decision Processes (FiMDP): A Practical Approach to Consumption. FM 2021: 640-656 - [i5]Murat Cubuktepe, Frantisek Blahoudek, Ufuk Topcu:
Polynomial-Time Algorithms for Multi-Agent Minimal-Capacity Planning. CoRR abs/2105.01225 (2021) - [i4]Frantisek Blahoudek, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Efficient Strategy Synthesis for MDPs with Resource Constraints. CoRR abs/2105.02099 (2021) - 2020
- [j1]Frantisek Blahoudek, Juraj Major, Jan Strejcek:
LTL to self-loop alternating automata with generic acceptance and back. Theor. Comput. Sci. 840: 122-142 (2020) - [c12]Frantisek Blahoudek, Alexandre Duret-Lutz, Jan Strejcek:
Seminator 2 Can Complement Generalized Büchi Automata via Improved Semi-determinization. CAV (2) 2020: 15-27 - [c11]Frantisek Blahoudek, Tomás Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Qualitative Controller Synthesis for Consumption Markov Decision Processes. CAV (2) 2020: 421-447 - [i3]Frantisek Blahoudek, Tomás Brázdil, Petr Novotný, Melkior Ornik, Pranay Thangeda, Ufuk Topcu:
Qualitative Controller Synthesis for Consumption Markov Decision Processes. CoRR abs/2005.07227 (2020)
2010 – 2019
- 2019
- [c10]Juraj Major, Frantisek Blahoudek, Jan Strejcek, Miriama Sasaráková, Tatiana Zboncáková:
ltl3tela: LTL to Small Deterministic or Nondeterministic Emerson-Lei Automata. ATVA 2019: 357-365 - [c9]Christel Baier, Frantisek Blahoudek, Alexandre Duret-Lutz, Joachim Klein, David Müller, Jan Strejcek:
Generic Emptiness Check for Fun and Profit. ATVA 2019: 445-461 - [c8]Frantisek Blahoudek, Juraj Major, Jan Strejcek:
LTL to Smaller Self-Loop Alternating Automata and Back. ICTAC 2019: 152-171 - [i2]Frantisek Blahoudek, Juraj Major, Jan Strejcek:
LTL to Smaller Self-Loop Alternating Automata and Back. CoRR abs/1908.04645 (2019) - 2017
- [c7]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 - 2016
- [c6]Frantisek Blahoudek, Matthias Heizmann, Sven Schewe, Jan Strejcek, Ming-Hsien Tsai:
Complementing Semi-deterministic Büchi Automata. TACAS 2016: 770-787 - 2015
- [c5]Tomás Babiak, Frantisek Blahoudek, Alexandre Duret-Lutz, Joachim Klein, Jan Kretínský, David Müller, David Parker, Jan Strejcek:
The Hanoi Omega-Automata Format. CAV (1) 2015: 479-486 - [c4]Frantisek Blahoudek, Alexandre Duret-Lutz, Vojtech Rujbr, Jan Strejcek:
On Refinement of Büchi Automata for Explicit Model Checking. SPIN 2015: 66-83 - 2014
- [c3]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
- [c2]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 - [c1]Frantisek Blahoudek, Mojmír Kretínský, Jan Strejcek:
Comparison of LTL to Deterministic Rabin Automata Translators. LPAR 2013: 164-172 - [i1]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)
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 2024-08-05 21:21 CEST 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:
