Skip to Main content Skip to Navigation
Conference papers

Compositional design methodology with constraint Markov chains

Benoit Caillaud 1 Benoît Delahaye 1 Kim Guldstrand Larsen 2 Axel Legay 1 Mikkel L. Pedersen 2 Andrzej Wasowski 3 
1 S4 - System synthesis and supervision, scenarios
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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.
Document type :
Conference papers
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Benoît Delahaye Connect in order to contact the contributor
Submitted on : Monday, May 9, 2011 - 3:53:10 PM
Last modification on : Friday, February 4, 2022 - 3:22:19 AM
Long-term archiving on: : Wednesday, August 10, 2011 - 2:48:27 AM


Files produced by the author(s)



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⟩



Record views


Files downloads