inria-00404304, version 2
Compositional Design Methodology with Constraint Markov Chains
Benoit Caillaud
a, 1Benoît Delahaye
b, 1Kim G. Larsen c, 2Axel Legay
a, 1Mikkel L. Pedersen c, 2Andrzej Wasowski d, 3
N° RR-6993 (2009)
Abstract: A specification theory combines notions of specification and implementation with a satisfaction relation, a refinement relation and a set of operators that together support stepwise design. We propose a new abstraction, Constraint Markov Chains, and use it to construct a specification theory for Markov Chains. Constraint Markov Chains generalize previously known abstractions by allowing arbitrary constraints on probability distributions. Our theory is the first specification theory for Markov Chains closed under conjunction, parallel composition and synchronization. Moreover, all the operators and relations introduced are computable.
- a – INRIA
- b – Université de Rennes 1
- c – Alborg University, Danemark
- d – IT University of Copenhagen
- 1: S4 (INRIA - IRISA)
- CNRS : UMR6074 – INRIA – INSA Rennes – Université de Rennes 1
- 2: University of Aalborg
- University of Aalborg
- 3: IT University of Copenhagen (IT)
- IT University of Copenhagen
- Collaboration : Aalborg University, IT University of Copenhagen
- Domain : Computer Science/Modeling and Simulation
- Keywords : Compositional Reasoning – Probability – CMC
- Internal note : RR-6993
- Available versions : v1 (2009-07-16) v2 (2010-05-25)
- inria-00404304, version 2
- http://hal.inria.fr/inria-00404304
- oai:hal.inria.fr:inria-00404304
- From: Benoît Delahaye
- Submitted on: Tuesday, 25 May 2010 12:55:09
- Updated on: Tuesday, 9 November 2010 16:42:17






Associated documents

Export