23 citations · 48 across the 17 of their papers we have counts for
3 papers · 1 filter
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…
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +1
Quantitative games are two-player zero-sum games played on directed weighted graphs. Total-payoff games (that can be seen as a refinement of the well-studied mean-payoff games) are…
Adding Negative Prices to Priced Timed Games
Thomas Brihaye, Gilles Geeraerts, Shankara Narayanan Krishna +3
Priced timed games (PTGs) are two-player zero-sum games played on the infinite graph of configurations of priced timed automata where two players take turns to choose transitions i…