Compositional design methodology with constraint Markov chains - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Compositional design methodology with constraint Markov chains

Abstract

Notions of specification, implementation, satisfaction, and refinement, together with operators supporting stepwise design, constitute a {specification theory}. We construct such a theory for Markov Chains (MCs) employing a new abstraction of a Constraint MC. Constraint MCs permit rich constraints on probability distributions and thus generalize prior abstractions such as Interval MCs. Linear (polynomial) constraints suffice for closure under conjunction (respectively parallel composition). This is the first specification theory for MCs with such closure properties. We discuss its relation to simpler operators for known languages such as probabilistic process algebra. Despite the generality, all operators and relations are computable.
Fichier principal
Vignette du fichier
paper.pdf (180.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00591578 , version 1 (09-05-2011)

Identifiers

Cite

Benoit Caillaud, Benoît Delahaye, Kim Guldstrand Larsen, Axel Legay, Mikkel L. Pedersen, et al.. Compositional design methodology with constraint Markov chains. QEST 2010, Sep 2010, Williamsburg, Virginia, United States. ⟨10.1109/QEST.2010.23⟩. ⟨inria-00591578⟩
177 View
141 Download

Altmetric

Share

Gmail Facebook X LinkedIn More