First-Order Model Checking on Generalisations of Pushdown Graphs
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 collapsible pushdown graphs. Our main results are the following. First-order logic with reachability is uniformly decidable on...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English en |
| Published: |
2011
|
| Online Access: | http://tuprints.ulb.tu-darmstadt.de/2681/1/Phd-Thesis-Kartzow.pdf Kartzow, Alexander <http://tuprints.ulb.tu-darmstadt.de/view/person/Kartzow=3AAlexander=3A=3A.html> : First-Order Model Checking on Generalisations of Pushdown Graphs. Technische Universität, Darmstadt [Ph.D. Thesis], (2011) |