7 citations · 16 across the 10 of their papers we have counts for
6 papers · 1 filter
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…
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.…
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…
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…