Compositional design methodology with constraint Markov chains
(2010) QEST 2010 — Location: Williamsburg, VA, USA (15.September.2010)
Files
No attached file found for this publication.
Details
- Authors
- 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.
Citations
Caillaud, B., Delahaye, B., Larsen Kim, G., Legay, A., Pedersen Mikkel, L., & Wasowski, A. (2010). Compositional design methodology with constraint Markov chains. 2010 Seventh International Conference on the Quantitative Evaluation of Systems. QEST 2010, Williamsburg, VA, USA. https://doi.org/10.1109/QEST.2010.23