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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2011, 412 (34), pp.4373-4404. 〈10.1016/j.tcs.2011.05.010〉
Liste complète des métadonnées
Contributeur : Benoît Caillaud <>
Soumis le : mardi 20 décembre 2011 - 16:40:38
Dernière modification le : jeudi 17 mai 2018 - 12:52:03

Lien texte intégral



Benoit Caillaud, Benoît Delahaye, Kim Guldstrand Larsen, Axel Legay, Mikkel L. Pedersen, et al.. Constraint Markov Chains. Theoretical Computer Science, Elsevier, 2011, 412 (34), pp.4373-4404. 〈10.1016/j.tcs.2011.05.010〉. 〈hal-00654003〉



Consultations de la notice