scientific article; zbMATH DE number 1796135
From MaRDI portal
Publication:4551151
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (8)
Modular strategies for recursive game graphs ⋮ On modelling recursive calls and callbacks with two variants of unified modelling language state diagrams ⋮ A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Improved model checking of hierarchical systems ⋮ Analyzing probabilistic pushdown automata ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Deterministic finite automata with recursive calls and DPDAs ⋮ Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
This page was built for publication:
