Pages that link to "Item:Q1854405"

The following pages link to Pushdown processes: Games and model-checking (Q1854405):

Displaying 50 items.

• Infinite games specified by 2-tape automata (Q324245) (← links)
• Branching-time logics with path relativisation (Q386037) (← links)
• Improved model checking of hierarchical systems (Q418123) (← links)
• Krivine machines and higher-order schemes (Q476196) (← links)
• Visibly pushdown modular games (Q515657) (← links)
• The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates (Q690498) (← links)
• Games with winning conditions of high Borel complexity (Q817850) (← links)
• On the positional determinacy of edge-labeled games (Q818128) (← links)
• Model-checking structured context-free languages (Q832277) (← links)
• Reachability in recursive Markov decision processes (Q924718) (← links)
• Partially commutative inverse monoids. (Q958191) (← links)
• On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
• Note on winning positions on pushdown games with \(\omega\)-regular conditions (Q1007544) (← links)
• Automatic verification of recursive procedures with one integer parameter. (Q1401233) (← links)
• Simulation preorder over simple process algebras (Q1854513) (← links)
• DP lower bounds for equivalence-checking and model-checking of one-counter automata (Q1887159) (← links)
• On decidability and complexity of low-dimensional robot games (Q2009641) (← links)
• Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
• Automata on infinite trees (Q2074210) (← links)
• Reactive synthesis from visibly register pushdown automata (Q2119985) (← links)
• Finite-state strategies in delay games (Q2182729) (← links)
• Operator precedence temporal logic and model checking (Q2215961) (← links)
• Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems (Q2272985) (← links)
• Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
• Modular strategies for recursive game graphs (Q2368953) (← links)
• Games for active XML revisited (Q2402614) (← links)
• Model checking of pushdown systems for projection temporal logic (Q2424879) (← links)
• Fixpoint logics over hierarchical structures (Q2429724) (← links)
• On effective construction of the greatest solution of language inequality \(XA\subseteq BX\) (Q2437851) (← links)
• Marking shortest paths on pushdown graphs does not preserve MSO decidability (Q2629775) (← links)
• Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
• On Robot Games of Degree Two (Q2799175) (← links)
• Simplification Problems for Deterministic Pushdown Automata on Infinite Words (Q2800412) (← links)
• THE COMPLEXITY OF COVERAGE (Q2841992) (← links)
• Automated formal analysis and verification: an overview (Q2871577) (← links)
• Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
• Bounding Average-Energy Games (Q2988367) (← links)
• Krivine Machines and Higher-Order Schemes (Q3012917) (← links)
• Model Checking Procedural Programs (Q3176375) (← links)
• Graph Games and Reactive Synthesis (Q3176385) (← links)
• Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (Q3195698) (← links)
• (Q3384169) (← links)
• (Q3384888) (← links)
• Complete SAT-Based Model Checking for Context-Free Processes (Q3510785) (← links)
• COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES (Q3552516) (← links)
• Games on Multi-stack Pushdown Systems (Q3605543) (← links)
• PDL with intersection and converse: satisfiability and infinite-state model checking (Q3616354) (← links)
• Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
• Games on Higher Order Multi-stack Pushdown Systems (Q3646264) (← links)
• Linear-time temporal logics with Presburger constraints: an overview ★ (Q3647243) (← links)