Round- and context-bounded control of dynamic pushdown systems
From MaRDI portal
Cites work
- Alternating vector addition systems with states
- An Algorithm for the General Petri Net Reachability Problem
- Bounded synthesis of register transducers
- Computer Science Logic
- Concurrent games on VASS with inhibition
- Context-bounded analysis for concurrent programs with dynamic creation of threads
- Context-Bounded Analysis of Concurrent Queue Systems
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Games on Multi-stack Pushdown Systems
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Keeping a crowd safe: on the complexity of parameterized verification (invited talk)
- Model Checking Games for Branching Time Logics
- On notions of regularity for data languages
- On reachability-related games on vector addition systems with states
- On Reasoning About Rings
- Parameterized Model Checking of Token-Passing Systems
- Parameterized Synthesis
- Pushdown processes: Games and model-checking
- Reachability games on extended vector addition systems with states
- Round-bounded control of parameterized systems
- Solving parity games on integer vectors
- Synthesis of Data Word Transducers
- The Reachability Problem for Petri Nets Is Not Elementary
- Tools and Algorithms for the Construction and Analysis of Systems
- Two-variable logic on data words
This page was built for publication: Round- and context-bounded control of dynamic pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564172)
