In this paper, we propose a probabilistic extension of the Creol modeling language, called PCreol, for which we give the operational semantics in Probabilistic Rewrite Logic. We give details on the implementation of a prototype PCreol interpreter, executable in Maude, on top of the existing one for Creol. We also achieved the integration of PCreol with the VeStA tool, which allows for statistical model checking and statistical quantitative analysis of PCreol programs. We give two example PCreol programs and show how VeStA can be used to study their properties. The paper is concluded with a number of future research directions
The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and veri...
A multitude of different probabilistic programming languages exists today, all extending a tradition...
We investigate the suitability of statistical model checking techniques for analysing quantitative p...
AbstractWe introduce a rewrite-based specification language for modelling probabilistic concurrent a...
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitio...
Abstract. Several formal models combine probabilistic and nondeterministic features. To allow their ...
International audienceSeveral formal models combine probabilistic and nondeterministic features. To ...
Abstract Invited TalkProbabilistic logic programs combine the power of a programming language with a...
International audienceWe introduce a probabilistic extension of our previous work SPLA: a formal fra...
We introduce a probabilistic extension of our previous work SPLA: a formal framework to specify and ...
This is a formalization of probabilistic models in Isabelle/HOL. It builds on Isabelle’s probability...
Current needs in the verification of systems evolve from boolean properties to finer quantitative pr...
Synchronous reactive languages were introduced for designing and implementing real-time control soft...
Abstract Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clar...
Probabilistic programming is an emerging subfield of AI that extends traditional programming languag...
The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and veri...
A multitude of different probabilistic programming languages exists today, all extending a tradition...
We investigate the suitability of statistical model checking techniques for analysing quantitative p...
AbstractWe introduce a rewrite-based specification language for modelling probabilistic concurrent a...
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitio...
Abstract. Several formal models combine probabilistic and nondeterministic features. To allow their ...
International audienceSeveral formal models combine probabilistic and nondeterministic features. To ...
Abstract Invited TalkProbabilistic logic programs combine the power of a programming language with a...
International audienceWe introduce a probabilistic extension of our previous work SPLA: a formal fra...
We introduce a probabilistic extension of our previous work SPLA: a formal framework to specify and ...
This is a formalization of probabilistic models in Isabelle/HOL. It builds on Isabelle’s probability...
Current needs in the verification of systems evolve from boolean properties to finer quantitative pr...
Synchronous reactive languages were introduced for designing and implementing real-time control soft...
Abstract Formal languages for probabilistic modeling enable re-use, modularity, and descriptive clar...
Probabilistic programming is an emerging subfield of AI that extends traditional programming languag...
The temporal logics pCTL and pCTL* have been proposed as tools for the formal specification and veri...
A multitude of different probabilistic programming languages exists today, all extending a tradition...
We investigate the suitability of statistical model checking techniques for analysing quantitative p...