Handbook of theoretical computer science (vol. B)
Verifying infinite state processes with sequential and parallel composition
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Model Checking the Full Modal Mu-Calculus for Infinite Sequential Processes
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Pushdown Processes: Parallel Composition and Model Checking
CONCUR '94 Proceedings of the Concurrency Theory
Model Checking of macro Processes
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Pushdown Processes: Games and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Grammars with macro-like productions
SWAT '68 Proceedings of the 9th Annual Symposium on Switching and Automata Theory (swat 1968)
Higher-Order Pushdown Trees Are Easy
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Since Muller and Schupp have shown that monadic second-order logic is decidable for context-free graphs in [MS85], several specialized procedures have been developed for related problems, mostly for sublogics like the modal µ-calculus, or even its alternation-free fragment. This work shows the decidability of SlS, the trace version of MSOL, for the richer set of macro graphs. The generation mechanism of macro graphs is of higher-order nature and relates to the context-free one like macro grammars [Fis68] relate to context-free grammars. Technically, the result follows from the decidability of the emptiness problem of the trace language of a macro graph with fairness. The decision procedure is given in form of a tableau system. Soundness and completeness follow from the relation of the (finite) tableaux to their infinite unfoldings. This kind of proof promises to be helpful in the derivation of further results.