Probabilistic Real-Time Calculus 

Luca Santinelli (INRIA Nancy)

A challenging research issue of analyzing real-time systems is to
model with probabilites the elements composing the system.  Elements
are tasks and applications which ask for resources, schedulers
which executes tasks, and resource provisioning elements which satisfy
the resource demand. 
In this talk, we present a model which condiders real-time systems as
component-based systems with component interfaces able to abstract both
the functional and non-functional requirements of components then the
system.
The model we propose, faces probabilities and probabilistic
real-time systems, though it offers probabilistic abstractions for the
system components.
Consequently, we unify in the same framework probabilistic scheduling
techniques and compositional guarantees that go from soft to hard
real-time.
We provide sufficient schedulability conditions for task systems using
such framework when the scheduler is either preemptive fixed-priority
or earliest deadline first.