Parametric, Probabilistic, Timed Resource Discovery System

  title={Parametric, Probabilistic, Timed Resource Discovery System},
  author={Camille Coti},
  • Camille Coti
  • Published in Cassting/SynCoP 2 August 2016
  • Computer Science
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. 

Figures from this paper



Queue-less, Uncentralized Resource Discovery: Formal Specification and Verification

This paper presents a formal approach for the specification and the verification of a fully distributed resource reservation system that is made of two parts: the launcher, executed by the user who wants to run a job on a set of computing nodes, and the agent, which is a daemon running on all the resources that exist in the system.

Time Petri Net Models for a New Queuless and Uncentralized Resource Discovery System

This report details the model using Petri Nets of a new fully distributed resource reservation system to let a user reserve a set of resources on a local network and to use them, without any specific, central administration component such as a front-end node.

A batch scheduler with high level components

The design choices and the evaluation of a batch scheduler for large clusters, named OAR, which is based upon an original design that emphasizes on low software complexity by using high level tools is presented.

Behavioral Cartography of Timed Automata

A novel approach based on the decomposition of the parametric space into behavioral tiles, i.e., sets of parameter valuations for which the behavior of the system is uniform, to find a set of timing parameters for which a given timed automaton has a “good” behavior.

Verification of Workflow Nets

This paper focuses on a class of Petri nets suitable for the representation, validation and verification of business procedures and shows that the correctness of a procedure represented by such a Petri net can be verified by using standard Petri-net-based techniques.

Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication

The heartbeat failure detector is novel: it is implementable without timeouts and it does not output lists of suspects as typical failure detectors do, which shows that traditional failure detectors that output only lists of suspect have fundamental limitations.

Zero Configuration Networking (Zeroconf) WWW Page

  • Zero Configuration Networking (Zeroconf) WWW Page

LSF: Load Sharing Facility. WWW Page: Available at

  • LSF: Load Sharing Facility. WWW Page: Available at

WWW Page: .php. Available at torque-resource-manager.php

  • WWW Page: .php. Available at torque-resource-manager.php

Zero Configuration Networking (Zeroconf)