7 citations · 16 across the 10 of their papers we have counts for
12 papers
Model Checking Constraint LTL over Trees
Alexander Kartzow, Thomas Weidner
Constraint automata are an adaptation of Büchi-automata that process data words where the data comes from some relational structure S. Every transition of such an automaton comes w…
Satisfiability of ECTL* with tree constraints
Claudia Carapelle, Shiguang Feng, Alexander Kartzow +1
Recently, we have shown that satisfiability for with constraints over is decidable using a new technique. This approach reduces the satisfiability pr…
The field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic
Alexander Kartzow
Recently, Schlicht and Stephan lifted the notion of automatic-structures to the notion of (finite-word) ordinal-automatic structures. These are structures whose domain and relation…
Reachability in Higher-Order-Counters
Alexander Heußner, Alexander Kartzow
Higher-order counter automata (\HOCS) can be either seen as a restriction of higher-order pushdown automata (\HOPS) to a unary stack alphabet, or as an extension of counter automat…
Satisfiability of CTL* with constraints
Claudia Carapelle, Alexander Kartzow, Markus Lohrey
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g.…
Structures Without Scattered-Automatic Presentation
Alexander Kartzow, Philipp Schlicht
Bruyere and Carton lifted the notion of finite automata reading infinite words to finite automata reading words with shape an arbitrary linear order L. Automata on finite words can…
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Alexander Kartzow
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constra…
First-Order Logic on Higher-Order Nested Pushdown Trees
Alexander Kartzow
We introduce a new hierarchy of higher-order nested pushdown trees generalising Alur et al.'s concept of nested pushdown trees. Nested pushdown trees are useful representations of…
First-Order Model Checking on Generalisations of Pushdown Graphs
Alexander Kartzow
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsi…
Tree-Automatic Well-Founded Trees
Martin Huschenbett, Alexander Kartzow, Jiamou Liu +1
We investigate tree-automatic well-founded trees. Using Delhomme's decomposition technique for tree-automatic structures, we show that the (ordinal) rank of a tree-automatic well-f…
Strictness of the Collapsible Pushdown Hierarchy
Alexander Kartzow, Paweł Parys
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author's pumping lemma for higher-order pushdown graphs (without coll…
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Alexander Kartzow
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even when we allow -contractions and add a reachability predicate (with regular cons…