Parametric, Probabilistic, Timed Resource Discovery System
This work addresses the problem of ensuring reliable execution of distributed applications on resources, but it is incremental as it builds on existing modeling techniques without introducing a new paradigm.
The paper tackles the challenge of verifying distributed resource discovery and reservation systems by presenting a semi-formal model using probabilistic timed automata, which is timed, parametric, and probabilistic, posing a challenge for parameter synthesis.
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.