scientific article; zbMATH DE number 6783472

zbMath1374.68272MaRDI QIDQ5365120

Krishnendu Chatterjee, Monika R. Henzinger

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133137

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

zbMATH Keywords

graph decompositionparity objectivesprobabilistic verificationdynamic graph algorithmsmaximal end-components

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Specification and verification (program logics, model checking, etc.) (68Q60) Graph algorithms (graph-theoretic aspects) (05C85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (24)

An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation ⋮ Synthesizing efficient systems in probabilistic environments ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Markov automata with multiple objectives ⋮ Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition ⋮ Trading performance for stability in Markov decision processes ⋮ A Tutorial on Interactive Markov Chains ⋮ Value iteration for simple stochastic games: stopping criterion and learning algorithm ⋮ Minimal counterexamples for linear-time probabilistic verification ⋮ Unnamed Item ⋮ Probabilistic opacity for Markov decision processes ⋮ Generic Emptiness Check for Fun and Profit ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Long-Run Rewards for Markov Automata ⋮ Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components ⋮ Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives ⋮ Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives ⋮ Attribute-Based Signatures for Circuits from Bilinear Map ⋮ CEGAR for compositional analysis of qualitative properties in Markov decision processes ⋮ Unnamed Item ⋮ Measuring and Synthesizing Systems in Probabilistic Environments ⋮ Unnamed Item ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Optimal cost almost-sure reachability in POMDPs

This page was built for publication: