4 papers
Equivalence of Linear Tree Transducers with Output in the Free Group
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
We show that equivalence of deterministic linear tree transducers can be decided in polynomial time when their outputs are interpreted over the free group. Due to the cancellation…
On the Balancedness of Tree-to-word Transducers
Raphaela Löbel, Michael Luttenberger, Helmut Seidl
A language over an alphabet of opening () and closing () brackets, is balanced if it is a subset of the Dyck language over , and…
The 5th Reactive Synthesis Competition (SYNTCOMP 2018): Benchmarks, Participants & Results
Swen Jacobs, Roderick Bloem, Maximilien Colange +11
We report on the fifth reactive synthesis competition (SYNTCOMP 2018). We introduce four new benchmark classes that have been added to the SYNTCOMP library, and briefly describe th…
Practical Synthesis of Reactive Systems from LTL Specifications via Parity Games
Michael Luttenberger, Philipp J. Meyer, Salomon Sickert
The synthesis of reactive systems from linear temporal logic (LTL) specifications is an important aspect in the design of reliable software and hardware. We present our adaption of…