On the public citation graph
What is decidable about partially observable Markov decision processes with ω-regular objectives
0 signed · 115 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11672142_26openalex-snapshot
Markov Decision Processes with Multiple Objectives
inferredcites →https://doi.org/10.1007/11874683_19openalex-snapshot
Algorithms for Omega-Regular Games with Imperfect Information
inferredcites →https://doi.org/10.1007/3-540-44622-2openalex-snapshot
Computer Science Logic: 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings
inferredcites →https://doi.org/10.1007/3-540-46029-2_13openalex-snapshot
PRISM: Probabilistic Symbolic Model Checker
inferredcites →https://doi.org/10.1007/3-540-62034-6openalex-snapshot
Foundations of Software Technology and Theoretical Computer Science
inferredcites →https://doi.org/10.1007/978-1-4612-4054-9openalex-snapshot
Competitive Markov Decision Processes
inferredcites →https://doi.org/10.1007/978-1-4612-4190-4openalex-snapshot
Classical Descriptive Set Theory
inferredcites →https://doi.org/10.1007/978-3-540-71389-0openalex-snapshot
Foundations of Software Science and Computational Structures
inferredcites →https://doi.org/10.1007/978-3-540-74915-8openalex-snapshot
Computer science logic : 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007 : proceedings
inferredcites →https://doi.org/10.1007/978-3-540-77050-3_39openalex-snapshot
Markov Decision Processes with Multiple Long-Run Average Objectives
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_21openalex-snapshot
On Decision Problems for Probabilistic Büchi Automata
inferredcites →https://doi.org/10.1007/978-3-642-00768-2_7openalex-snapshot
Alpaga: A Tool for Solving Parity Games with Imperfect Information
inferredcites →https://doi.org/10.1007/978-3-642-03816-7openalex-snapshot
Mathematical Foundations of Computer Science 2009
inferredcites →https://doi.org/10.1007/978-3-642-12002-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferredcites →https://doi.org/10.1007/978-3-642-14162-1_44openalex-snapshot
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
inferredcites →https://doi.org/10.1007/978-3-642-15155-2_24openalex-snapshot
Qualitative Analysis of Partially-Observable Markov Decision Processes
inferredcites →https://doi.org/10.1007/978-3-642-15643-4_1openalex-snapshot
Probabilistic Automata on Infinite Words: Decidability and Undecidability Results
inferredcites →https://doi.org/10.1007/978-3-642-22012-8openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_20openalex-snapshot
Quantitative Synthesis for Concurrent Programs
inferredcites →https://doi.org/10.1007/978-3-642-31424-7openalex-snapshot
Computer Aided Verification 24th International Conference, CAV 2012, Berkeley, CA, USA, July 7-13, 2012 Proceedings
inferredcites →https://doi.org/10.1007/978-3-642-37075-5openalex-snapshot
Foundations of Software Science and Computation Structures
inferredcites →https://doi.org/10.1007/978-3-642-54830-7_16openalex-snapshot
The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies
inferredcites →https://doi.org/10.1007/978-3-642-54830-7_2openalex-snapshot
Active Diagnosis for Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_10openalex-snapshot
Digital Images and Formal Languages
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_7openalex-snapshot
Languages, Automata, and Logic
inferredcites →https://doi.org/10.1007/978-3-662-07675-0openalex-snapshot
Handbook of Formal Languages
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_10openalex-snapshot
Games with a Weak Adversary
inferredcites →https://doi.org/10.1007/pl00008917openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
inferredcites →https://doi.org/10.1007/s001650300009openalex-snapshot
Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol
inferredcites →https://doi.org/10.1016/0012-365x(72)90124-0openalex-snapshot
Introduction to probabilistic automata
inferredcites →https://doi.org/10.1016/0022-0000(84)90034-5openalex-snapshot
The complexity of two-player games of incomplete information
inferredcites →https://doi.org/10.1016/b978-1-55860-377-6.50052-9openalex-snapshot
Learning policies for partially observable environments: Scaling up
inferredcites →https://doi.org/10.1016/c2009-0-12299-7openalex-snapshot
Uncertainty in Artificial Intelligence
inferredcites →https://doi.org/10.1016/c2013-0-11297-4openalex-snapshot
Introduction to Probabilistic Automata
inferredcites →https://doi.org/10.1016/j.artint.2014.12.009openalex-snapshot
POMDPs under probabilistic semantics
inferredcites →https://doi.org/10.1016/s0004-3702(02)00378-8openalex-snapshot
On the undecidability of probabilistic planning and related stochastic optimization problems
inferredcites →https://doi.org/10.1109/icra.2013.6630559openalex-snapshot
Automated model approximation for robotic navigation with POMDPs
inferredcites →https://doi.org/10.1109/icra.2015.7139019openalex-snapshot
Qualitative analysis of POMDPs with temporal logic specifications for robotics applications
inferredcites →https://doi.org/10.1109/jcai15434.2009openalex-snapshot
2009 International Joint Conference on Artificial Intelligence
inferredcites →https://doi.org/10.1109/robot.2004.1307420openalex-snapshot
A point-based POMDP algorithm for robot planning
inferredcites →https://doi.org/10.1109/sfcs.1989.63519openalex-snapshot
On the complexity of space bounded interactive proofs
inferredcites →https://doi.org/10.1109/tro.2009.2030225openalex-snapshot
Temporal-Logic-Based Reactive Mission and Motion Planning
inferredcites →https://doi.org/10.1145/1086228.1086265openalex-snapshot
Code aware resource management
inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferredcites →https://doi.org/10.1145/237477.237523openalex-snapshot
Foundations of computer science
inferredcites →https://doi.org/10.1145/800135.804422openalex-snapshot
Universal games of incomplete information
inferredcites →https://doi.org/10.1287/moor.12.3.441openalex-snapshot
The Complexity of Markov Decision Processes
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems
inferredcites →https://doi.org/10.2168/lmcs-10(1:13)2014openalex-snapshot
Markov Decision Processes with Multiple Long-run Average Objectives
inferredcites →https://doi.org/10.2307/1266484openalex-snapshot
Dynamic Programming and Markov Processes
inferredcites →https://doi.org/10.2307/2282268openalex-snapshot
Dynamic Programming and Markov Processes.
inferredcites →https://doi.org/10.4230/lipics.csl.2013.165openalex-snapshot
What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives
inferredcites →https://doi.org/10.48550/arxiv.1104.4306openalex-snapshot
Quantitative Synthesis for Concurrent Programs
inferredcites →https://doi.org/10.48550/arxiv.1301.6720openalex-snapshot
Solving POMDPs by Searching the Space of Finite Policies
inferredcites →https://doi.org/10.5555/1036843.1036906openalex-snapshot
Heuristic search value iteration for POMDPs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-44051-0_8openalex-snapshot
Online Partial Conditional Plan Synthesis for POMDPs with Safe-Reachability Objectives
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_16openalex-snapshot
Scenario-Based Verification of Uncertain MDPs
inferred← citeshttps://doi.org/10.1007/978-3-030-62077-6_12openalex-snapshot
Modelchecking Safety Properties in Randomized Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_26openalex-snapshot
Robust Almost-Sure Reachability in Multi-Environment MDPs
inferred← citeshttps://doi.org/10.1007/978-3-031-32013-2_4openalex-snapshot
Answerable and Unanswerable Questions in Decision and Risk Analysis
inferred← citeshttps://doi.org/10.1007/978-3-031-32013-2_9openalex-snapshot
Causally Explainable Decision Recommendations Using Causal Artificial Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_15openalex-snapshot
Learning Explainable and Better Performing Representations of POMDP Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_3openalex-snapshot
Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_21openalex-snapshot
The 10,000 Facets of MDP Model Checking
inferred← citeshttps://doi.org/10.1007/s10009-023-00704-3openalex-snapshot
Decision-making under uncertainty: beyond probabilities
inferred← citeshttps://doi.org/10.1007/s10462-024-10732-3openalex-snapshot
On the computational complexity of ethics: moral tractability for minds and machines
inferred← citeshttps://doi.org/10.1007/s10703-015-0235-2openalex-snapshot
CEGAR for compositional analysis of qualitative properties in Markov decision processes
inferred← citeshttps://doi.org/10.1007/s11098-024-02249-wopenalex-snapshot
Beyond Preferences in AI Alignment
inferred← citeshttps://doi.org/10.1007/s11334-022-00452-8openalex-snapshot
Probabilistic causes in Markov chains
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109654openalex-snapshot
Supervisor synthesis of POMDP via automata learning
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112196openalex-snapshot
On the detection of Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.cogsys.2024.101234openalex-snapshot
Artificial enactive inference in three-dimensional world
inferred← citeshttps://doi.org/10.1016/j.cor.2022.106113openalex-snapshot
Efficient sensor placement and online scheduling of bin collection
inferred← citeshttps://doi.org/10.1016/j.rcim.2018.10.011openalex-snapshot
Performance guaranteed human-robot collaboration with POMDP supervisory control
inferred← citeshttps://doi.org/10.1109/allerton.2018.8635859openalex-snapshot
Verification of Uncertain POMDPs Using Barrier Certificates
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263971openalex-snapshot
Motion planning under partial observability using game-based abstraction
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619061openalex-snapshot
Privacy Verification in POMDPs via Barrier Certificates
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304266openalex-snapshot
Barrier Functions for Multiagent-POMDPs with DTL Specifications
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683486openalex-snapshot
Time-Optimal Navigation in Uncertain Environments with High-Level Specifications
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196844openalex-snapshot
Uncertainty Quantification with Statistical Guarantees in End-to-End Autonomous Driving Control
inferred← citeshttps://doi.org/10.1109/lra.2019.2898045openalex-snapshot
Point-Based Policy Synthesis for POMDPs With Boolean and Quantitative Objectives
inferred← citeshttps://doi.org/10.1109/ojcsys.2023.3294829openalex-snapshot
Robustly Complete Finite-State Abstractions for Control Synthesis of Stochastic Systems
inferred← citeshttps://doi.org/10.1109/spw50608.2020.00046openalex-snapshot
Partially Observable Games for Secure Autonomy
inferred← citeshttps://doi.org/10.1109/tac.2016.2518639openalex-snapshot
Synthesis of Joint Control and Active Sensing Strategies Under Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1109/tac.2020.2990140openalex-snapshot
Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions
inferred← citeshttps://doi.org/10.1109/tac.2020.3035755openalex-snapshot
Control Theory Meets POMDPs: A Hybrid Systems Approach
inferred← citeshttps://doi.org/10.1109/tac.2022.3183564openalex-snapshot
Entropy Maximization for Partially Observable Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/tase.2021.3057111openalex-snapshot
Online Partial Conditional Plan Synthesis for POMDPs With Safe-Reachability Objectives: Methods and Experiments
inferred← citeshttps://doi.org/10.1111/risa.13553openalex-snapshot
Answerable and Unanswerable Questions in Risk Analysis with Open‐World Novelty
inferred← citeshttps://doi.org/10.1145/2728606.2728617openalex-snapshot
Temporal logic motion planning using POMDPs with parity objectives
inferred← citeshttps://doi.org/10.1145/3292048.3292052openalex-snapshot
From verification to synthesis under cost-utility constraints
inferred← citeshttps://doi.org/10.1145/3313149.3313366openalex-snapshot
Correct-by-construction policies for POMDPs
inferred← citeshttps://doi.org/10.1145/3329123openalex-snapshot
Reasoning about Cognitive Trust in Stochastic Multiagent Systems
inferred← citeshttps://doi.org/10.1162/neco_a_01698openalex-snapshot
Active Inference and Reinforcement Learning: A Unified Inference on Continuous State and Action Spaces Under Partial Observability
inferred← citeshttps://doi.org/10.1186/s43065-021-00027-0openalex-snapshot
Value of information analysis in civil and infrastructure engineering: a review
inferred← citeshttps://doi.org/10.15479/at:ista:th_730openalex-snapshot
Statistical and logical methods for property checking
inferred← citeshttps://doi.org/10.23919/acc.2019.8815376openalex-snapshot
Barrier Certificates for Assured Machine Teaching
inferred← citeshttps://doi.org/10.24963/ijcai.2019/768openalex-snapshot
Counterexample-Guided Strategy Improvement for POMDPs Using Recurrent Neural Networks
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d97openalex-snapshot
Scenario-Based Verification of Uncertain MDPs
inferred← citeshttps://doi.org/10.3390/e23050601openalex-snapshot
Information Structures for Causally Explainable Decisions
inferred← citeshttps://doi.org/10.48550/arxiv.1510.08474openalex-snapshot
Control with Probabilistic Signal Temporal Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1701.06209openalex-snapshot
Counterexample-guided Abstraction Refinement for POMDPs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08262openalex-snapshot
Supervisor Synthesis of POMDP based on Automata Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1708.04236openalex-snapshot
Strategy Synthesis in POMDPs via Game-Based Abstractions
inferred← citeshttps://doi.org/10.48550/arxiv.1807.03823openalex-snapshot
Verification of Uncertain POMDPs Using Barrier Certificates
inferred← citeshttps://doi.org/10.48550/arxiv.1810.00092openalex-snapshot
The Partially Observable Games We Play for Cyber Deception
inferred← citeshttps://doi.org/10.48550/arxiv.2110.07409openalex-snapshot
The Geometry of Memoryless Stochastic Policy Optimization in Infinite-Horizon POMDPs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.