23 citations · 48 across the 17 of their papers we have counts for
4 papers · 1 filter
An Automata Theoretic Characterization of Weighted First-Order Logic
Dhruv Nevatia, Benjamin Monmege
Since the 1970s with the work of McNaughton, Papert and Schützenberger, a regular language is known to be definable in the first-order logic if and only if its syntactic monoid is…
Optimal controller synthesis for timed systems
Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier
Weighted timed games are zero-sum games played by two players on a timed automaton equipped with weights, where one player wants to minimise the cumulative weight while reaching a…
Real-Time Synthesis is Hard!
Thomas Brihaye, Morgane Estiévenart, Gilles Geeraerts +3
We study the reactive synthesis problem (RS) for specifications given in Metric Interval Temporal Logic (MITL). RS is known to be undecidable in a very general setting, but on infi…
A Robust Class of Data Languages and an Application to Learning
Benedikt Bollig, Peter Habermehl, Martin Leucker +1
We introduce session automata, an automata model to process data words, i.e., words over an infinite alphabet. Session automata support the notion of fresh data values, which are w…