Skip to content <title>Channels - Stubborn Set Reduction for Two-Player Reachability Games :: FRELIP Discovery

Home Search Guides Journals Learning

FRELIP Discovery Search

Open Access Catalog for African Scholarship

Channels
Stubborn Set Reduction for Two-Player Reachability Games

Search for more channels:

Similar Items: Stubborn Set Reduction for Two-Player Reachability Games

View Record
Explore related channels

Quick Look
Reachability Switching Games
Quick Look
O-Minimal Hybrid Reachability Games
Quick Look
On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
Quick Look
The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games
Quick Look
Reachability under Contextual Locking
Quick Look
Reachability Analysis of Innermost Rewriting
Quick Look
All-Path Reachability Logic
Quick Look
Reachability Analysis of Communicating Pushdown Systems
Quick Look
Reachability and liveness in parametric timed automata
Quick Look
Vector Addition System Reversible Reachability Problem
Quick Look
Reachability Problem for Weak Multi-Pushdown Automata
Quick Look
Bounded Reachability Problems are Decidable in FIFO Machines
Quick Look
Reductions to the set of random strings: The resource-bounded case
Quick Look
The Complexity of Reachability in Affine Vector Addition Systems with States
Quick Look
On Reachability for Unidirectional Channel Systems Extended with Regular Tests
Quick Look
Reachability for infinite time Turing machines with long tapes
Quick Look
Verification of Correlated Equilibria in Concurrent Reachability Games
Quick Look
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Quick Look
Fast Strategy Solving for the Informed Player in Two-Player Zero-Sum Linear-Quadratic Differential Games with One-Sided Information
Quick Look
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
Quick Look
Petri Net Reachability Graphs: Decidability Status of First Order Properties
Quick Look
Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
Quick Look
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
Quick Look
Guarding a convex target set in a particular case of the game of two cars

About FRELIP

Free eLibrary Portal (FRELIP) provides access to academic resources, research materials, and scholarly publications from Nigerian universities and research institutions.

Quick Links

FRELIP Home
About FRELIP
Research Guides
Search Catalog

Resources

Indexed Records: 13,069+
RSS Feeds: 6,699+
Disciplines: 14
Subjects: 155

© 2026 FRELIP - Free eLibrary Portal | frelip.org | Powered by VuFind