Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
XML PDF e-pub
PDF e-Pub

Section: New Results

Timed, Probabilistic, and Stochastic Extensions

Model Checking for Extended PCTL

Participants : Radu Mateescu, José Ignacio Requeno.

In the context of the SENSATION project (see § ), we study the specification and verification of quantitative properties of concurrent systems.

In 2015, we developed a probabilistic version of ACTL (Action-based CTL)  [41] , named PACTL. This logic represents an action-based counterpart for PCTL (Probabilistic Computation Tree Logic[50] and is interpreted naturally over DTMCs with labeled transitions, such as those produced from IPCs (Interactive Probabilistic Chains[40] . The PACTL operators generalize those of ACTL: they characterize sequences of transitions in the DTMC by specifying both the states and the actions labeling the transitions. We implemented PACTL as an XTL library, which allows the designer to combine properties on actions, data, probabilities, and discrete time. We have experimented the PACTL library on several DTMCs imported from the probabilistic model checker PRISM  [55] to ensure that both implementations provide the same numerical results.