scientific article; zbMATH DE number 794257
From MaRDI portal
Publication:4847017
zbMath0839.68028MaRDI QIDQ4847017
Olaf Burkart, Bernhard Steffen
Publication date: 28 May 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Complexity results on branching-time pushdown model checking, Reachability analysis of pushdown automata: Application to model-checking, Never-stop context-free learning, Efficient CTL model-checking for pushdown systems, A model checking-based approach for security policy verification of mobile systems, Model checking the full modal mu-calculus for infinite sequential processes, Verification of Boolean programs with unbounded thread creation, Decidability of bisimulation equivalence for normed pushdown processes, A saturation method for the modal \(\mu \)-calculus over pushdown systems, An Automata-Theoretic Approach to Infinite-State Systems, Ensuring completeness of symbolic verification methods for infinite-state systems, Efficient CTL Model-Checking for Pushdown Systems, Decidability of bisimulation equivalence for normed pushdown processes, Model checking the full modal mu-calculus for infinite sequential processes, Model checking of systems with many identical timed processes
