Abstract
This paper studies a difference operator for stochastic systems whose specifications are represented by Abstract Probabilistic Automata (APAs). In the case refinement fails between two specifications, the target of this operator is to produce a specification APA that represents all witness PAs of this failure. Our contribution is an algorithm that allows to approximate the difference of two deterministic APAs with arbitrary precision. Our technique relies on new quantitative notions of distances between APAs used to assess convergence of the approximations as well as on an in-depth inspection of the refinement relation for APAs. The procedure is effective and not more complex than refinement checking. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Delahaye, B., Fahrenberg, U., Guldstrand Larsen, K., & Legay, A. (2013). Refinement and difference for probabilistic automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8054 LNCS, pp. 22–38). https://doi.org/10.1007/978-3-642-40196-1_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
