Static Enforcement of Service Deadlines

We consider the problem of statically deciding when a service always provides its functionality within a given amount of time. In a timed π-calculus, we propose a two-phases static analysis guaranteeing that processes enjoy both the maximal progress and the well-timedness properties. Exploiting this analysis, we devise a decision procedure for checking service deadlines.