sign in
english version rss feed

inria-00404304, version 2

Compositional Design Methodology with Constraint Markov Chains

Benoit Caillaud () a1, Benoît Delahaye () b1, Kim G. Larsen c2, Axel Legay () a1, Mikkel L. Pedersen c2, Andrzej Wasowski d3

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.

  • 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
  • oai:hal.inria.fr:inria-00404304
  • From: 
  • Submitted on: Tuesday, 25 May 2010 12:55:09
  • Updated on: Tuesday, 9 November 2010 16:42:17
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...
all articles on CCSd database...