scientific article; zbMATH DE number 2080197
From MaRDI portal
Publication:4472439
zbMath1044.68111MaRDI QIDQ4472439
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740127.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (23)
Hyperplane separation technique for multidimensional mean-payoff games ⋮ Complexity results on branching-time pushdown model checking ⋮ Model Checking Procedural Programs ⋮ Model Checking Concurrent Programs ⋮ Branching-time model-checking of probabilistic pushdown automata ⋮ Efficient CTL model-checking for pushdown systems ⋮ Model checking of pushdown systems for projection temporal logic ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Improved model checking of hierarchical systems ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ Fixpoint logics over hierarchical structures ⋮ Unnamed Item ⋮ Temporal property verification as a program analysis task ⋮ Analyzing probabilistic pushdown automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ Characterizing EF and EX tree logics ⋮ A general approach to comparing infinite-state systems with their finite-state specifications ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time ⋮ Efficient CTL Model-Checking for Pushdown Systems ⋮ Model Checking FO(R) over One-Counter Processes and beyond
This page was built for publication:
