3 citations · 5 across the 4 of their papers we have counts for
6 papers
Word Equations in Synergy with Regular Constraints (Technical Report)
František Blahoudek, Yu-Fang Chen, David Chocholatý +4
When eating spaghetti, one should have the sauce and noodles mixed instead of eating them separately. We argue that also in string solving, word equations and regular constraints a…
Efficient Strategy Synthesis for MDPs with Resource Constraints
František Blahoudek, Petr Novotný, Melkior Ornik +2
We consider qualitative strategy synthesis for the formalism called consumption Markov decision processes. This formalism can model dynamics of an agents that operates under resour…
Polynomial-Time Algorithms for Multi-Agent Minimal-Capacity Planning
Murat Cubuktepe, František Blahoudek, Ufuk Topcu
We study the problem of minimizing the resource capacity of autonomous agents cooperating to achieve a shared task. More specifically, we consider high-level planning for a team of…
Qualitative Controller Synthesis for Consumption Markov Decision Processes
František Blahoudek, Tomáš Brázdil, Petr Novotný +3
Consumption Markov Decision Processes (CMDPs) are probabilistic decision-making models of resource-constrained systems. In a CMDP, the controller possesses a certain amount of a cr…
LTL to Smaller Self-Loop Alternating Automata and Back
František Blahoudek, Juraj Major, Jan Strejček
Self-loop alternating automata (SLAA) with Büchi or co-Büchi acceptance are popular intermediate formalisms in translations of LTL to deterministic or nondeterministic automata. Th…
Effective Translation of LTL to Deterministic Rabin Automata: Beyond the (F,G)-Fragment
Tomáš Babiak, František Blahoudek, Mojmír Křetínský +1
Some applications of linear temporal logic (LTL) require to translate formulae of the logic to deterministic omega-automata. There are currently two translators producing determini…