Refinement and Difference for Probabilistic Automata

Delahaye, BenoƮt;Fahrenberg, Uli;Larsen Kim, Guldstrand;Legay, Axel
(2013) QEST 2013 - 10th International Conference Quantitative Evaluation of Systems (27.August.2013)

Files

No attached file found for this publication.

Details

Authors
  • Delahaye, BenoĆ®t
    Author
  • Fahrenberg, Uli
    Author
  • Larsen Kim, Guldstrand
    Author
  • Legay, AxelUCLouvain
    Author
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.

Citations

  • APA
  • Chicago
  • FWB

Delahaye, B., Fahrenberg, U., Larsen Kim, G., & Legay, A. (2013). Refinement and Difference for Probabilistic Automata. Quantitative Evaluation of Systems Lecture Notes in Computer Science. QEST 2013 - 10th International Conference Quantitative Evaluation of Systems. https://doi.org/10.1007/978-3-642-40196-1_3