### Abstract

Original language | Undefined |
---|---|

Title of host publication | 5th International Symposium on Trustworthly Global Computing, TGC 2010 |

Place of Publication | Berlin |

Publisher | Springer Verlag |

Pages | 335-347 |

Number of pages | 13 |

ISBN (Print) | 978-3-642-15639-7 |

DOIs | |

State | Published - 2010 |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer Verlag |

Volume | 6084 |

### Fingerprint

### Keywords

- IR-75853
- EWI-19431
- METIS-276316

### Cite this

*5th International Symposium on Trustworthly Global Computing, TGC 2010*(pp. 335-347). (Lecture Notes in Computer Science; Vol. 6084). Berlin: Springer Verlag. DOI: 10.1007/978-3-642-15640-3_22

}

*5th International Symposium on Trustworthly Global Computing, TGC 2010.*Lecture Notes in Computer Science, vol. 6084, Springer Verlag, Berlin, pp. 335-347. DOI: 10.1007/978-3-642-15640-3_22

**Approximate Model Checking of Stochastic COWS.** / Quaglia, Paola; Schivo, Stefano.

Research output: Scientific - peer-review › Conference contribution

TY - CHAP

T1 - Approximate Model Checking of Stochastic COWS

AU - Quaglia,Paola

AU - Schivo,Stefano

N1 - 10.1007/978-3-642-15640-3_22

PY - 2010

Y1 - 2010

N2 - Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the formula. Only a subset of the properties that can be analyzed by exact model checking can be attacked by approximate methods. These latest methods, though, being based on simulation and sampling have the advantage of not requiring the generation of the complete state-space of the model. Here we describe an efficient tool for the approximate model checking of services written in a stochastic variant of COWS, a process calculus for the orchestration of services.

AB - Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the formula. Only a subset of the properties that can be analyzed by exact model checking can be attacked by approximate methods. These latest methods, though, being based on simulation and sampling have the advantage of not requiring the generation of the complete state-space of the model. Here we describe an efficient tool for the approximate model checking of services written in a stochastic variant of COWS, a process calculus for the orchestration of services.

KW - IR-75853

KW - EWI-19431

KW - METIS-276316

U2 - 10.1007/978-3-642-15640-3_22

DO - 10.1007/978-3-642-15640-3_22

M3 - Conference contribution

SN - 978-3-642-15639-7

T3 - Lecture Notes in Computer Science

SP - 335

EP - 347

BT - 5th International Symposium on Trustworthly Global Computing, TGC 2010

PB - Springer Verlag

ER -