1 citations · 1 across the 1 of their papers we have counts for
4 papers
Presburger arithmetic with threshold counting quantifiers is easy
Dmitry Chistikov, Christoph Haase, Alessio Mansutti
We give a quantifier elimination procedures for the extension of Presburger arithmetic with a unary threshold counting quantifier that determines whether the nu…
Directed Reachability for Infinite-State Systems
Michael Blondin, Christoph Haase, Philip Offtermatt
Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachabilit…
On the Expressiveness of Büchi Arithmetic
Christoph Haase, Jakub Różycki
We show that the existential fragment of Büchi arithmetic is strictly less expressive than full Büchi arithmetic of any base, and moreover establish that its -fragment is alre…
On the Size of Finite Rational Matrix Semigroups
Georgina Bumpus, Christoph Haase, Stefan Kiefer +2
Let be a positive integer and a set of rational -matrices such that generates a finite multiplicative semigroup. We show that any matrix i…