Pushdown processes: Games and model-checking
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 794257
- Model-checking iterated games
- Model-checking iterated games
- Games and model checking for guarded logics
- Automata games for multiple-model checking
- Model Checking Games for Branching Time Logics
- Model-Checking Games for Fixpoint Logics with Partial Order Models
- Model-checking games for fixpoint logics with partial order models
- Model Checking Games
Cites work
- scientific article; zbMATH DE number 446840 (Why is no real title available?)
- scientific article; zbMATH DE number 3972842 (Why is no real title available?)
- scientific article; zbMATH DE number 3990873 (Why is no real title available?)
- scientific article; zbMATH DE number 65755 (Why is no real title available?)
- scientific article; zbMATH DE number 1017515 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 4119652 (Why is no real title available?)
- Alternation
- An automata theoretic decision procedure for the propositional mu- calculus
- Fast and simple nested fixpoints
- Fixed point characterization of infinite behavior of finite-state systems
- Games for the -calculus
- On the synthesis of strategies in infinite games
- The theory of ends, pushdown automata, and second-order logic
Cited in
(74)- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Automata, Logic and Games for the $$\lambda $$ -Calculus
- scientific article; zbMATH DE number 794257 (Why is no real title available?)
- Topological properties of omega context-free languages
- The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
- Deciding Parity Games in Quasi-polynomial Time
- Model-checking structured context-free languages
- Model checking of pushdown systems for projection temporal logic
- Three notes on the complexity of model checking fixpoint logic with chop
- Round- and context-bounded control of dynamic pushdown systems
- Reachability in recursive Markov decision processes
- Improved model checking of hierarchical systems
- Reactive synthesis from visibly register pushdown automata
- Note on winning positions on pushdown games with \(\omega\)-regular conditions
- Domains for Higher-Order Games
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
- PDL with intersection and converse: satisfiability and infinite-state model checking
- DP lower bounds for equivalence-checking and model-checking of one-counter automata
- Automatic verification of recursive procedures with one integer parameter.
- Marking shortest paths on pushdown graphs does not preserve MSO decidability
- Automata on infinite trees
- Model checking procedural programs
- On decidability and complexity of low-dimensional robot games
- Weighted automata on infinite words in the context of attacker-defender games
- Hyperplane separation technique for multidimensional mean-payoff games
- Optimal strategies in pushdown reachability games
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Automated formal analysis and verification: an overview
- Model checking the full modal mu-calculus for infinite sequential processes
- Games on Higher Order Multi-stack Pushdown Systems
- Operator precedence temporal logic and model checking
- scientific article; zbMATH DE number 7471692 (Why is no real title available?)
- Inverse monoids: decidability and complexity of algebraic questions.
- Modular strategies for recursive game graphs
- Simulation preorder over simple process algebras
- Complete SAT-Based Model Checking for Context-Free Processes
- scientific article; zbMATH DE number 7104937 (Why is no real title available?)
- Simplification problems for deterministic pushdown automata on infinite words
- Bounding Average-Energy Games
- Game characterization of probabilistic bisimilarity, and applications to pushdown automata
- Decidability of model checking with the temporal logic EF
- A Branching Time Variant of CaRet
- Infinite games specified by 2-tape automata
- scientific article; zbMATH DE number 7438566 (Why is no real title available?)
- μ-Bicomplete Categories and Parity Games
- Abstraction in fixpoint logic
- Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
- Linear-time temporal logics with Presburger constraints: an overview
- Model Checking FO(R) over One-Counter Processes and beyond
- Games on Multi-stack Pushdown Systems
- Graph Games and Reactive Synthesis
- Krivine machines and higher-order schemes
- Krivine machines and higher-order schemes
- Optimally Resilient Strategies in Pushdown Safety Games
- Model-checking \(\mathrm{CTL}^*\) over flat Presburger counter systems
- COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
- Weighted automata on infinite words in the context of attacker-defender games
- Partially commutative inverse monoids.
- Automated Technology for Verification and Analysis
- Free \(\mu\)-lattices
- The complexity of coverage
- Games for active XML revisited
- Efficient CTL verification via Horn constraints solving
- Finite-state strategies in delay games
- Finite-state strategies in delay games
- Two-Way Tree Automata Solving Pushdown Games
- On the positional determinacy of edge-labeled games
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Visibly pushdown modular games
- scientific article; zbMATH DE number 7447741 (Why is no real title available?)
- Games with winning conditions of high Borel complexity
- Branching-time logics with path relativisation
- Fixpoint logics over hierarchical structures
- On robot games of degree two
This page was built for publication: Pushdown processes: Games and model-checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854405)
