27 citations · 46 across the 9 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2011★ 3 cited
Trees over Infinite Structures and Path Logics with Synchronization
Alex Spelten, Wolfgang Thomas, Sarah Winter
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinit…
cs.LO2011★ 1 cited
The First-Order Theory of Ground Tree Rewrite Graphs
Stefan Göller, Markus Lohrey
We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(2^{2^{poly(n)}},O(n)). Providing a matching lower bound, we show that there…
cs.LO2007★ 8 cited
Model Checking Synchronized Products of Infinite Transition Systems
Stefan Wöhrle, Wolfgang Thomas
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic h…