Skip to Main content Skip to Navigation
Journal articles

Refinement and Difference for Probabilistic Automata

Benoit 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 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 to implement than refinement checking.
Document type :
Journal articles
Complete list of metadata

Cited literature [49 references]  Display  Hide  Download
Contributor : Benoît Delahaye Connect in order to contact the contributor
Submitted on : Friday, June 20, 2014 - 4:44:42 PM
Last modification on : Wednesday, April 27, 2022 - 3:54:02 AM
Long-term archiving on: : Saturday, September 20, 2014 - 11:11:03 AM


Files produced by the author(s)


  • HAL Id : hal-01010866, version 1


Benoit Delahaye, Uli Fahrenberg, Kim Guldstrand Larsen, Axel Legay. Refinement and Difference for Probabilistic Automata. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2014, pp.LMCS-2013-936. ⟨hal-01010866⟩



Record views


Files downloads