On the public citation graph
Markov decision processes and regular events
0 signed · 143 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/bfb0023741openalex-snapshot
Synthesizing processes and schedulers from temporal specifications
inferredcites →https://doi.org/10.1007/bfb0035748openalex-snapshot
Realizable and unrealizable specifications of reactive systems
inferredcites →https://doi.org/10.1016/0020-0255(88)90001-1openalex-snapshot
On observability of discrete-event systems
inferredcites →https://doi.org/10.1016/0022-247x(85)90288-4openalex-snapshot
Optimal policies for controlled Markov chains with a constraint
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0019-9958(82)91022-1openalex-snapshot
Reasoning with time and chance
inferredcites →https://doi.org/10.1016/s0019-9958(83)80051-5openalex-snapshot
Temporal logic can be more expressive
inferredcites →https://doi.org/10.1017/s0001867800015792openalex-snapshot
Time-average optimal constrained semi-Markov decision processes
inferredcites →https://doi.org/10.1057/jors.1986.12openalex-snapshot
Linear Programming and Finite Markovian Control Problems
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1109/9.402openalex-snapshot
Supervisory control of discrete-event processes with partial observations
inferredcites →https://doi.org/10.1109/9.8645openalex-snapshot
Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
inferredcites →https://doi.org/10.1109/fscs.1990.89597openalex-snapshot
Distributed reactive systems are hard to synthesize
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1109/sfcs.1988.21950openalex-snapshot
Verifying temporal properties of finite-state probabilistic programs
inferredcites →https://doi.org/10.1137/0325013openalex-snapshot
Supervisory Control of a Class of Discrete Event Processes
inferredcites →https://doi.org/10.1137/0325036openalex-snapshot
On the Supremal Controllable Sublanguage of a Given Language
inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferredcites →https://doi.org/10.1145/75277.75293openalex-snapshot
On the synthesis of a reactive module
inferredcites →https://doi.org/10.1145/78942.78948openalex-snapshot
Adding liveness properties to coupled finite-state machines
inferredcites →https://doi.org/10.1145/800057.808660openalex-snapshot
Probabilistic temporal logics for finite and bounded models
inferredcites →https://doi.org/10.1287/opre.37.5.780openalex-snapshot
Markov Decision Processes with Sample Path Constraints: The Communicating Case
inferredcites →https://doi.org/10.2307/2289262openalex-snapshot
Introduction to Stochastic Dynamic Programming.
inferredcites →https://doi.org/10.2307/2580904openalex-snapshot
Linear Programming and Finite Markovian Control Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferred← citeshttps://doi.org/10.1007/11523468_72openalex-snapshot
Recursive Markov Decision Processes and Recursive Stochastic Games
inferred← citeshttps://doi.org/10.1007/11681960_28openalex-snapshot
Probabilistic Verification of Uncertain Systems Using Bounded-Parameter Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/11691372_26openalex-snapshot
Model-Checking Markov Chains in the Presence of Uncertainties
inferred← citeshttps://doi.org/10.1007/11804192_19openalex-snapshot
Partial Order Reduction for Markov Decision Processes: A Survey
inferred← citeshttps://doi.org/10.1007/11901914_1openalex-snapshot
Analysis of Recursive Probabilistic Models
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_25openalex-snapshot
Weak Bisimulation for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot
Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-44898-5_13openalex-snapshot
Abstract Interpretation of Programs as Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/3-540-46419-0_27openalex-snapshot
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_7openalex-snapshot
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_16openalex-snapshot
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_27openalex-snapshot
Probabilistic Hyperproperties of Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-61739-4_5openalex-snapshot
Qualitative Multi-objective Reachability for Ordered Branching MDPs
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_8openalex-snapshot
Verification of Markov Decision Processes Using Learning Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-17130-2_15openalex-snapshot
Synthesis with Rational Environments
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_5openalex-snapshot
On Probabilistic Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_35openalex-snapshot
Perfect-Information Stochastic Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_15openalex-snapshot
Verifying ω-Regular Properties of Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-70844-5_3openalex-snapshot
Automata, Probability, and Recursion
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_18openalex-snapshot
Pure Stationary Optimal Strategies in Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_6openalex-snapshot
Multi-objective Model Checking of Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_73openalex-snapshot
Perfect Information Stochastic Priority Games
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_36openalex-snapshot
Stochastic Müller Games are PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_39openalex-snapshot
Markov Decision Processes with Multiple Long-Run Average Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_13openalex-snapshot
Model Checking Linear-Time Properties of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_25openalex-snapshot
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games
inferred← citeshttps://doi.org/10.1007/978-3-642-03092-5_4openalex-snapshot
Probabilistic Systems with LimSup and LimInf Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-04027-6_37openalex-snapshot
Decision Problems for Nash Equilibria in Stochastic Games
inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_3openalex-snapshot
Assume-Guarantee Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_34openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-19811-3_2openalex-snapshot
Automated Learning of Probabilistic Assumptions for Compositional Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_11openalex-snapshot
Quantitative Multi-objective Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21455-4_3openalex-snapshot
Automated Verification Techniques for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_28openalex-snapshot
Synthesizing Efficient Controllers
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_28openalex-snapshot
Synthesizing Probabilistic Composers
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_22openalex-snapshot
Automatic Verification of Competitive Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_27openalex-snapshot
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_28openalex-snapshot
Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_10openalex-snapshot
Probabilistic Model Checking: Formalisms and Algorithms for Discrete and Real-time Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_15openalex-snapshot
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-981-33-4859-2_29openalex-snapshot
Reinforcement Learning: A Survey
inferred← citeshttps://doi.org/10.1007/bfb0023457openalex-snapshot
Temporal logics for the specification of performance and reliability
inferred← citeshttps://doi.org/10.1007/s00182-023-00860-5openalex-snapshot
Submixing and shift-invariant stochastic games
inferred← citeshttps://doi.org/10.1007/s00236-017-0307-4openalex-snapshot
Spanning the spectrum from safety to liveness
inferred← citeshttps://doi.org/10.1007/s002360050136openalex-snapshot
Polytime model checking for timed probabilistic computation tree logic
inferred← citeshttps://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferred← citeshttps://doi.org/10.1007/s10472-016-9508-8openalex-snapshot
Synthesis with rational environments
inferred← citeshttps://doi.org/10.1016/j.artint.2007.12.002openalex-snapshot
Reachability analysis of uncertain systems using bounded-parameter Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.ic.2011.11.004openalex-snapshot
The complexity of stochastic Müller games
inferred← citeshttps://doi.org/10.1016/j.ic.2012.01.008openalex-snapshot
Approximating the termination value of one-counter MDPs and stochastic games
inferred← citeshttps://doi.org/10.1016/j.ic.2013.10.001openalex-snapshot
Compositional probabilistic verification through multi-objective model checking
inferred← citeshttps://doi.org/10.1016/j.ic.2016.11.006openalex-snapshot
Quantitative model-checking of controlled discrete-time Markov processes
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.07.009openalex-snapshot
Quantitative solution of omega-regular games
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.09.009openalex-snapshot
Trading performance for stability in Markov decision processes
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00046-9openalex-snapshot
Automatic verification of real-time systems with discrete probability distributions
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00215-8openalex-snapshot
On probabilistic timed automata
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80595-xopenalex-snapshot
Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80597-3openalex-snapshot
From Fairness to Chance
inferred← citeshttps://doi.org/10.1017/s0960129517000160openalex-snapshot
Converging from branching to linear metrics on Markov chains
inferred← citeshttps://doi.org/10.1109/acc.2011.5990952openalex-snapshot
Control of Markov decision processes from PCTL specifications
inferred← citeshttps://doi.org/10.1109/acc.2013.6579837openalex-snapshot
Minimum-violation LTL planning with conflicting specifications
inferred← citeshttps://doi.org/10.1109/cdc.2011.6161122openalex-snapshot
MDP optimal control under temporal logic constraints
inferred← citeshttps://doi.org/10.1109/icece.2010.1233openalex-snapshot
Combination of Three Sections of Beams of Experimental Modal Analysis Based on LabVIEW
inferred← citeshttps://doi.org/10.1109/icra.2012.6225290openalex-snapshot
Temporal logic motion control using actor-critic methods
inferred← citeshttps://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
inferred← citeshttps://doi.org/10.1109/lics.1998.705679openalex-snapshot
How to specify and verify the long-run average behaviour of probabilistic systems
inferred← citeshttps://doi.org/10.1109/lics.2000.855763openalex-snapshot
Concurrent omega-regular games
inferred← citeshttps://doi.org/10.1109/lics.2007.28openalex-snapshot
Limits of Multi-Discounted Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/lics.2011.10openalex-snapshot
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/lics.2013.39openalex-snapshot
Trading Performance for Stability in Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470739openalex-snapshot
Symbolic Time and Space Tradeoffs for Probabilistic Verification
inferred← citeshttps://doi.org/10.1109/qest.2004.1348037openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1109/qest.2004.30openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1109/qest.2008.45openalex-snapshot
Reduction Techniques for Model Checking Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/qest.2010.35openalex-snapshot
Reasoning about MDPs as Transformers of Probability Distributions
inferred← citeshttps://doi.org/10.1109/qest.2011.22openalex-snapshot
Model Checking MDPs with a Unique Compact Invariant Set of Distributions
inferred← citeshttps://doi.org/10.1109/sfcs.2005.19openalex-snapshot
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/tac.2014.2298143openalex-snapshot
Optimal Control of Markov Decision Processes With Linear Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1109/tse.2009.57openalex-snapshot
Directed Explicit State-Space Search in the Generation of Counterexamples for Stochastic Model Checking
inferred← citeshttps://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferred← citeshttps://doi.org/10.1145/2461328.2461330openalex-snapshot
Least-violating control strategy synthesis with safety rules
inferred← citeshttps://doi.org/10.1145/2699430openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.1145/2699431openalex-snapshot
Recursive Markov Decision Processes and Recursive Stochastic Games
inferred← citeshttps://doi.org/10.11575/prism/28710openalex-snapshot
WiFi-based Fine Timing Assistance for GPS Acquisition
inferred← citeshttps://doi.org/10.1177/0278364915581505openalex-snapshot
Temporal logic motion control using actor–critic methods
inferred← citeshttps://doi.org/10.1287/moor.2018.0970openalex-snapshot
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
inferred← citeshttps://doi.org/10.1613/jair.3987openalex-snapshot
A Survey of Multi-Objective Sequential Decision-Making
inferred← citeshttps://doi.org/10.17771/pucrio.acad.53926openalex-snapshot
DECODIFICAÇÃO BELIEF PROPAGATION ORIENTADA A Q-LEARNING PARA CÓDIGOS POLARES
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:13)2014openalex-snapshot
Markov Decision Processes with Multiple Long-run Average Objectives
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:8)2008openalex-snapshot
Multi-Objective Model Checking of Markov Decision Processes
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:20)2011openalex-snapshot
The Complexity of Nash Equilibria in Stochastic Multiplayer Games
inferred← citeshttps://doi.org/10.3182/20110828-6-it-1002.02287openalex-snapshot
LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees*
inferred← citeshttps://doi.org/10.3233/fun-2002-50101openalex-snapshot
Markov Decision Processes and Deterministic Büchi Automata
inferred← citeshttps://doi.org/10.4204/eptcs.50.2openalex-snapshot
Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives
inferred← citeshttps://doi.org/10.4204/eptcs.85.2openalex-snapshot
Efficient computation of exact solutions for quantitative model checking
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2010.108openalex-snapshot
One-Counter Stochastic Games
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.115openalex-snapshot
Reachability for Branching Concurrent Stochastic Games
inferred← citeshttps://doi.org/10.48550/arxiv.0904.2511openalex-snapshot
One-Counter Markov Decision Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0739openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1104.4978openalex-snapshot
Approximating the Termination Value of One-Counter MDPs and Stochastic Games
inferred← citeshttps://doi.org/10.48550/arxiv.1202.2185openalex-snapshot
Temporal Logic Motion Control using Actor-Critic Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1305.4103openalex-snapshot
Trading Performance for Stability in Markov Decision Processes
inferred← citeshttps://doi.org/10.48550/arxiv.1401.6575openalex-snapshot
Submixing and Shift-invariant Stochastic Games
inferred← citeshttps://doi.org/10.48550/arxiv.1502.04844openalex-snapshot
The Complexity of Synthesis from Probabilistic Components
inferred← citeshttps://doi.org/10.5117/9789089640574openalex-snapshot
New Perspectives on Games and Interaction
inferred← citeshttps://doi.org/10.5287/ora-y0bamqrpdopenalex-snapshot
Automated quantitative software verification
inferred← citeshttps://doi.org/10.5555/982792.982808openalex-snapshot
Quantitative stochastic parity games
inferred← citeshttps://doi.org/10.6092/unina/fedoa/10094openalex-snapshot
Logics for Multi-Agent Systems Verification
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.