 |
Institut de recherche en informatique et systèmes aléatoires |  |
|
Institut de recherche en informatique et systèmes aléatoires | |
| HAL : hal-00654003, version 1 |
| DOI : 10.1016/j.tcs.2011.05.010 |
| Voir la fiche détaillée |  BibTeX,EndNote,... |
 |
| Theoretical Computer Science 412, 34 (2011) 4373-4404 |
|
|
|
|
| Constraint Markov Chains |
|
|
| Benoit Caillaud 1Benoît Delahaye 1 |
|
|
| (15/05/2011) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | S4 (INRIA - IRISA) |
|
|
|
CNRS : UMR6074 – INRIA – Institut National des Sciences Appliquées (INSA) - Rennes – Université de Rennes 1 |
|
|
| 2 : | University of Aalborg |
|
|
|
University of Aalborg |
|
|
| 3 : | IT University of Copenhagen (IT) |
|
|
|
IT University of Copenhagen |
|
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Autre |
|
|
| Specification theory – Markov Chains – Compositional reasoning – Abstraction – Process algebra |
|
| hal-00654003, version 1 | |
| http://hal.inria.fr/hal-00654003 | |
| oai:hal.inria.fr:hal-00654003 | |
| Contributeur : Benoit Caillaud | |
| Soumis le : Mardi 20 Décembre 2011, 16:40:38 | |
| Dernière modification le : Mardi 20 Décembre 2011, 16:40:38 | |
