Abstract
Interval Markov Chains (IMCs) are the base of a classic probabilistic specification theory by Larsen and Jonsson in 1991. They are also a popular abstraction for probabilistic systems. In this paper we study complexity of several problems for this abstraction, that stem from compositional modeling methodologies. In particular we close the complexity gap for thorough refinement of two IMCs and for deciding the existence of a common implementation for an unbounded number of IMCs, showing that these problems are EXPTIME-complete. We also prove that deciding consistency of an IMC is polynomial and discuss suitable notions of determinism for such specifications. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Delahaye, B., Larsen, K. G., Legay, A., Pedersen, M. L., & Wa̧sowski, A. (2011). Decision problems for interval Markov chains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 274–285). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
