Delahaye, Benoît
Fahrenberg, Uli
Larsen Kim, Guldstrand
Legay, Axel
[UCL]
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.


Bibliographic reference |
Delahaye, Benoît ; Fahrenberg, Uli ; Larsen Kim, Guldstrand ; Legay, Axel. Refinement and Difference for Probabilistic Automata.QEST 2013 - 10th International Conference Quantitative Evaluation of Systems (du 27/08/2013 au 30/08/2013). In: Quantitative Evaluation of Systems Lecture Notes in Computer Science, Springer Berlin Heidelberg : Berlin, Heidelberg2013 |
Permanent URL |
https://hdl.handle.net/2078.1/210597 |