scientific article; zbMATH DE number 2163041

zbMath1073.93037MaRDI QIDQ4673428

Frank Ciesinski, Martin Leucker, Benedikt Bollig, Marcus Größer, Christel Baier

Publication date: 29 April 2005

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Markov decision processesNP-completenessgameNP-hardnesscontroller synthesis problemprobabilistic computation tree logiclinear time specificationscomputational complextytimed transition system

Mathematics Subject Classification ID

Discrete event control/observation systems (93C65) Synthesis problems (93B50) Stochastic games, stochastic differential games (91A15) Markov and semi-Markov decision processes (90C40) Stochastic systems in control theory (general) (93E03) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Graph Games and Reactive Synthesis ⋮ Model Checking Probabilistic Systems ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Verification and Control of Probabilistic Rectangular Hybrid Automata ⋮ Verification and Control of Partially Observable Probabilistic Real-Time Systems ⋮ On Pure Nash Equilibria in Stochastic Games ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ Verification and control of partially observable probabilistic systems ⋮ Unnamed Item ⋮ Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives ⋮ Quantitative Multi-objective Verification for Probabilistic Systems ⋮ Stochastic game logic ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Verification of multiplayer stochastic games via abstract dependency graphs

This page was built for publication: