Compositional Design Methodology with Constraint Markov Chains

Benoit Caillaud, Benoit Delahaye, Kim G. Larsen, Axel Legay, Mikkel L. Pedersen, Andrzej Wasowski
2010 2010 Seventh International Conference on the Quantitative Evaluation of Systems  
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
more » ... s 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.
doi:10.1109/qest.2010.23 dblp:conf/qest/CaillaudDLLPW10 fatcat:mp7guy7ag5b37inwhxgaqewfsa