scientific article; zbMATH DE number 794257
From MaRDI portal
Publication:4847017
Recommendations
Cited in
(19)- A Context-Free Process as a Pushdown Automaton
- Complexity results on branching-time pushdown model checking
- A model checking-based approach for security policy verification of mobile systems
- Never-stop context-free learning
- Model checking the full modal mu-calculus for infinite sequential processes
- An automata-theoretic approach to infinite-state systems
- Efficient CTL model-checking for pushdown systems
- A saturation method for the modal \(\mu \)-calculus over pushdown systems
- A basic parallel process as a parallel pushdown automaton
- Efficient CTL model-checking for pushdown systems
- Decidability of bisimulation equivalence for normed pushdown processes
- Model checking of systems with many identical timed processes
- Ensuring completeness of symbolic verification methods for infinite-state systems
- Verification of Boolean programs with unbounded thread creation
- Reachability analysis of pushdown automata: Application to model-checking
- Pushdown processes: Games and model-checking
- Model checking the full modal mu-calculus for infinite sequential processes
- Decidability of bisimulation equivalence for normed pushdown processes
- A Context-Free Symbiosis of Runtime Verification and Automata Learning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847017)
