Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains

DOI10.1007/11901914_13zbMath1161.68495OpenAlexW1489658028MaRDI QIDQ3522906

Javier Esparza, Dejvuth Suwimonteerabuth, Stefan Schwoon

Publication date: 4 September 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11901914_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Efficient CTL model-checking for pushdown systems ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Reachability on prefix-recognizable graphs ⋮ Efficient CTL Model-Checking for Pushdown Systems

This page was built for publication: Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains