activity
20192022
most citedWord Equations in Synergy with Regular Constraints (Technical Report)

1 citations · 1 across the 2 of their papers we have counts for

collaborators

5 papers

cs.LO20221 cited

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…

cs.AI2021

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…

cs.MA2021

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…

cs.FL2020

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…

cs.FL2019

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…