Compositional Bisimulation Minimization for Interval Markov Decision Processes

DOI10.1007/978-3-319-30000-9_9zbMath1435.68197OpenAlexW2402642317MaRDI QIDQ2798714

Holger Hermanns, Lei Song, Vahid Hashemi, Andrea Turrini, Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_9

zbMATH Keywords

complexitycompositionalityMarkov decision processbisimulationinterval MDP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (2)

Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions ⋮ Equivalence checking 40 years after: a review of bisimulation tools

This page was built for publication: Compositional Bisimulation Minimization for Interval Markov Decision Processes