scientific article
From MaRDI portal
Publication:2754072
zbMath0974.68083MaRDI QIDQ2754072
Orna Kupferman, Moshe Y. Vardi
Publication date: 11 November 2001
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 (18)
Automata Theory and Model Checking ⋮ Inverse monoids: decidability and complexity of algebraic questions. ⋮ Unnamed Item ⋮ Expressiveness and succinctness of a logic of robustness ⋮ Efficient CTL model-checking for pushdown systems ⋮ From bidirectionality to alternation. ⋮ Fixpoint logics over hierarchical structures ⋮ Analyzing pushdown systems with stack manipulation ⋮ Linear temporal logic symbolic model checking ⋮ Partially commutative inverse monoids. ⋮ Unnamed Item ⋮ An Automata-Theoretic Approach to the Reachability Analysis of RPPS Systems ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Note on winning positions on pushdown games with \(\omega\)-regular conditions ⋮ Efficient CTL Model-Checking for Pushdown Systems ⋮ Optimally Resilient Strategies in Pushdown Safety Games ⋮ The Complexity of Flat Freeze LTL ⋮ Games with winning conditions of high Borel complexity
Uses Software
This page was built for publication:
