Skip to Main content Skip to Navigation
Conference papers

Refinement and Difference for Probabilistic Automata

Benoît Delahaye 1 Uli Fahrenberg 2 Kim Guldstrand Larsen 3 Axel Legay 2 
LINA - Laboratoire d'Informatique de Nantes Atlantique
2 ESTASYS - Efficient STAtistical methods in SYstems of systems
Inria Rennes – Bretagne Atlantique , IRISA-D4 - LANGAGE ET GÉNIE LOGICIEL
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.
Complete list of metadata

Cited literature [41 references]  Display  Hide  Download
Contributor : Uli Fahrenberg Connect in order to contact the contributor
Submitted on : Thursday, November 27, 2014 - 10:01:06 AM
Last modification on : Wednesday, April 27, 2022 - 3:53:53 AM
Long-term archiving on: : Monday, March 2, 2015 - 9:18:49 AM


Files produced by the author(s)



Benoît Delahaye, Uli Fahrenberg, Kim Guldstrand Larsen, Axel Legay. Refinement and Difference for Probabilistic Automata. QEST 2013 - 10th International Conference Quantitative Evaluation of Systems, Aug 2013, Buenos Aires, Argentina. pp.22 - 38, ⟨10.1007/978-3-642-40196-1_3⟩. ⟨hal-01087931⟩



Record views


Files downloads