Parametric, Probabilistic, Timed Resource Discovery System

Camille Coti
(LIPN, CNRS UMR 7030, Université Paris 13, Sorbonne Paris Cité)

This paper presents a fully distributed resource discovery and reservation system. Verification of such a system is important to ensure the execution of distributed applications on a set of resources in appropriate conditions. A semi-formal model for his system is presented using probabilistic timed automata. This model is timed, parametric and probabilistic, making it a challenge to the parameter synthesis community.

In Thomas Brihaye, Benoît Delahaye, Loïg Jezequel, Nicolas Markey and Jiří Srba: Proceedings Cassting Workshop on Games for the Synthesis of Complex Systems and 3rd International Workshop on Synthesis of Complex Parameters (Cassting'16/SynCoP'16), Eindhoven, The Netherlands, April 2-3, 2016, Electronic Proceedings in Theoretical Computer Science 220, pp. 53–62.
Published: 31st July 2016.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: