6 papers
Minimizing Streaming String Transducers: An algebraic approach
Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier
In this work, we study minimization of rational functions given as appending streaming string transducers (aSST for short). We rely on an algebraic presentation of these functions,…
Lexicographic transductions of finite words
Emmanuel Filiot, Pierre-Alain Reynier, Nathan Lhote
Regular transductions over finite words have linear input-to-output growth. This class of transductions enjoys many characterizations. Recently, regular transductions have been ext…
Playing Stochastically in Weighted Timed Games to Emulate Memory
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the playe…
Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted Timed Games (WTG for short) are the most widely used model to describe controller synthesis problems involving real-time issues. Unfortunately, they are notoriously diffic…
Synthesis of Robust Optimal Strategies in Weighted Timed Games
Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier
Weighted Timed Games (WTG for short) are the most widely used model to describe controller synthesis problems involving real-time issues. The synthesized strategies rely on a perfe…
Minimizing Cost Register Automata over a Field
Yahia Idriss Benalioua, Nathan Lhote, Pierre-Alain Reynier
Weighted automata (WA) are an extension of finite automata that define functions from words to values in a given semiring. An alternative deterministic model, called Cost Register…