Model-checking LTL with regular valuations for pushdown systems
From MaRDI portal
Recommendations
Cited in
(17)- Types and trace effects for object orientation
- The complexity of bisimilarity-checking for one-counter processes.
- Analyzing pushdown systems with stack manipulation
- Model checking LTL with regular valuations for pushdown systems
- Model checking dynamic pushdown networks
- Model checking dynamic pushdown networks
- Efficient CTL model-checking for pushdown systems
- Winning Regions of Pushdown Parity Games: A Saturation Method
- An automata-theoretic approach to infinite-state systems
- Efficient CTL model-checking for pushdown systems
- Regularity in PDA games revisited
- A saturation method for the modal \(\mu \)-calculus over pushdown systems
- Model-Checking HyperLTL for Pushdown Systems
- An extension of pushdown system and its model checking method.
- Reachability analysis of pushdown automata: Application to model-checking
- Pushdown normal-form bisimulation: a nominal context-free approach to program equivalence
- Visibly recursive automata
This page was built for publication: Model-checking LTL with regular valuations for pushdown systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714447)