This paper presents SCOOP: a tool that symbolically optimises process-algebraic specifications of probabilistic processes. It takes specifications in the prCRL language (combining data and probabilities), which are linearised first to an intermediate format: the LPPE. On this format, optimisations such as dead-variable reduction and confluence reduction are applied automatically by SCOOP. That way, drastic state space reductions are achieved while never having to generate the complete state space, as data variables are unfolded only locally. The optimised state spaces are ready to be analysed by for instance CADP or PRISM
Imagine a world where computational simulations can be inverted as easily as running them forwards, ...
Symbolic data are distributions constructed from data points. When big datasets can be organised int...
Probabilistic software analysis (PSA) aims at computing the probability for a target event to occur ...
This paper presents a novel linear process algebraic format for probabilistic automata. The key ingr...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
AbstractThis paper presents a novel linear process-algebraic format for probabilistic automata. The ...
This paper presents a novel linear process algebraic format for probabilistic automata. The key ingr...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
In this presentation we introduce a novel technique for state space reduction of probabilistic speci...
This paper presents a novel technique for state space reduction of probabilistic specifications, bas...
Abstract—This paper presents a novel linear process alge-braic format for probabilistic automata. Th...
This paper presents a novel technique for state space reduction of probabilistic specifications, bas...
This presentation introduces a process-algebraic framework with data for modelling and generating Ma...
This paper introduces a framework for the efficient modelling and generation of Markov automata. It ...
In a world in which we increasingly rely on safety critical systems that simultaneously are becoming...
Imagine a world where computational simulations can be inverted as easily as running them forwards, ...
Symbolic data are distributions constructed from data points. When big datasets can be organised int...
Probabilistic software analysis (PSA) aims at computing the probability for a target event to occur ...
This paper presents a novel linear process algebraic format for probabilistic automata. The key ingr...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
AbstractThis paper presents a novel linear process-algebraic format for probabilistic automata. The ...
This paper presents a novel linear process algebraic format for probabilistic automata. The key ingr...
This paper presents a novel linear process-algebraic format for probabilistic automata. The key ingr...
In this presentation we introduce a novel technique for state space reduction of probabilistic speci...
This paper presents a novel technique for state space reduction of probabilistic specifications, bas...
Abstract—This paper presents a novel linear process alge-braic format for probabilistic automata. Th...
This paper presents a novel technique for state space reduction of probabilistic specifications, bas...
This presentation introduces a process-algebraic framework with data for modelling and generating Ma...
This paper introduces a framework for the efficient modelling and generation of Markov automata. It ...
In a world in which we increasingly rely on safety critical systems that simultaneously are becoming...
Imagine a world where computational simulations can be inverted as easily as running them forwards, ...
Symbolic data are distributions constructed from data points. When big datasets can be organised int...
Probabilistic software analysis (PSA) aims at computing the probability for a target event to occur ...