Identifies a class of trace-pushdown systems where the first-order theory of the configuration graph with reachability is decidable.
Inter- national Journal of Algebra and Computation18(08), 1345–1364 (2008)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The theory of reachability in trace-pushdown systems
Identifies a class of trace-pushdown systems where the first-order theory of the configuration graph with reachability is decidable.