23 citations · 34 across the 8 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…
On the Path-Width of Integer Linear Programming
Constantin Enea, Peter Habermehl, Omar Inverso +1
We consider the feasibility problem of integer linear programming (ILP). We show that solutions of any ILP instance can be naturally represented by an FO-definable class of graphs.…
Ordered Navigation on Multi-attributed Data Words
Normann Decker, Peter Habermehl, Martin Leucker +1
We study temporal logics and automata on multi-attributed data words. Recently, BD-LTL was introduced as a temporal logic on data words extending LTL by navigation along positions…