Markov decision processes and regular events
From MaRDI portal
Publication:4506554
DOI10.1109/9.720497zbMath0954.90061OpenAlexW4255368532MaRDI QIDQ4506554
Mihalis Yannakakis, Costas Courcoubetis
Publication date: 17 October 2000
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.720497
verificationcomplexitydiscrete-event systemsMarkov decision processesregular languages\(\omega\)-automataprobabilistic games
Control/observation systems involving computers (process control, etc.) (93C83) Markov and semi-Markov decision processes (90C40)
Related Items (45)
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations ⋮ Stabhyli ⋮ Synthesis with rational environments ⋮ Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes ⋮ Reachability analysis of uncertain systems using bounded-parameter Markov decision processes ⋮ Trading performance for stability in Markov decision processes ⋮ Compositional probabilistic verification through multi-objective model checking ⋮ Least-violating control strategy synthesis with safety rules ⋮ Limited-information control of hybrid systems via reachable set propagation ⋮ Resilient synchronization in robust networked multi-agent systems ⋮ Learning nonlinear hybrid systems ⋮ Mining requirements from closed-loop control models ⋮ On the decidability of stability of hybrid systems ⋮ Lyapunov analysis of rigid body systems with impacts and friction via sums-of-squares ⋮ Hybrid control lyapunov functions for the stabilization of hybridsystems ⋮ A toolbox for simulation of hybrid systems in matlab/simulink ⋮ Zélus ⋮ State estimation for polyhedral hybrid systems and applications to the Godunov scheme ⋮ Observer design for a class of piecewise affine hybrid systems ⋮ Automated analysis of real-time scheduling using graph games ⋮ Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets ⋮ One-shot computation of reachable sets for differential games ⋮ Tracking differentiable trajectories across polyhedra boundaries ⋮ Flowpipe approximation and clustering in space-time ⋮ Bounded model-checking of discrete duration calculus ⋮ Optimal CPU allocation to a set of control tasks with soft real--time execution constraints ⋮ Safe schedulability of bounded-rate multi-mode systems ⋮ Compositional heterogeneous abstraction ⋮ Quantitative timed simulation functions and refinement metrics for real-time systems ⋮ Formula-free finite abstractions for linear temporal verification of stochastic hybrid systems ⋮ Quantitative automata-based controller synthesis for non-autonomous stochastic hybrid systems ⋮ Control design for specifications on stochastic hybrid systems ⋮ Rewarding probabilistic hybrid automata ⋮ Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata ⋮ Specification-guided controller synthesis for linear systems and safe linear-time temporal logic ⋮ Temporal logic model predictive control for discrete-time systems ⋮ Iterative temporal motion planning for hybrid systems in partially unknown environments ⋮ Quantitative Multi-objective Verification for Probabilistic Systems ⋮ Quantitative model-checking of controlled discrete-time Markov processes ⋮ Quantifying opacity ⋮ Recursive Markov Decision Processes and Recursive Stochastic Games ⋮ Probabilistic Verification of Uncertain Systems Using Bounded-Parameter Markov Decision Processes ⋮ Decision Problems for Nash Equilibria in Stochastic Games ⋮ On probabilistic timed automata. ⋮ Automatic verification of real-time systems with discrete probability distributions.
This page was built for publication: Markov decision processes and regular events
