Publication:4551151
From MaRDI portal
zbMath0991.68535MaRDI QIDQ4551151
Mihalis Yannakakis, Kousha Etessami, Rajeev Alur
Publication date: 4 September 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2102/21020207
68Q45: Formal languages and automata
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
Improved model checking of hierarchical systems, On modelling recursive calls and callbacks with two variants of unified modelling language state diagrams, On the complexity of checking semantic equivalences between pushdown processes and finite-state processes, Deterministic finite automata with recursive calls and DPDAs, Analyzing probabilistic pushdown automata, Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems, Modular strategies for recursive game graphs, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata