International audienceThis talk reviews some of my contributions on formal testing of timed and probabilistic systems, focusing on methodologies that allow their users to decide whether these systems are correct with respect to a formal specification. The consideration of time and probability complicates the definition of these frameworks since there is not an obvious way to define correctness. For example, in a specific situation it might be desirable that a system is as fast as possible while in a different application it might be required that the performance of the system is exactly equal to the one given by the specification. All the methodologies have as common assumption that the system under test is a black-box and that the specific...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
AbstractProbabilistic elements are often introduced in concurrent programs in order to solve problem...
Probabilistic timed automata are timed automata extended with discrete probability distributions, an...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Abstract: This paper surveys some new tools and methods for formally verifying time performance prop...
none1noThe usefulness of formal methods for the description and verification of complex systems is n...
Abstract. Formal methods are one of the most important approaches to increasing the confidence in th...
The importance of model checking was acknowledged by a Turing award in 2007, and formal methods in g...
Many systems are inherently stochastic: they interact with unpredictable environments or use randomi...
AbstractIn this paper we present a method for testing a system against a non-deterministic stochasti...
Probabilistic model checking is a formal verification technique for systems that exhibit stochastic ...
Probabilistic timed automata, a variant of timed automata extended with discrete probability distrib...
In this paper we present a method for testing a system against a non-deterministic stochastic finite...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
. We consider the timed automata model of [3], which allows the analysis of real-time systems expres...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
AbstractProbabilistic elements are often introduced in concurrent programs in order to solve problem...
Probabilistic timed automata are timed automata extended with discrete probability distributions, an...
AbstractWe consider the specification and testing of systems where probabilistic information is not ...
Abstract: This paper surveys some new tools and methods for formally verifying time performance prop...
none1noThe usefulness of formal methods for the description and verification of complex systems is n...
Abstract. Formal methods are one of the most important approaches to increasing the confidence in th...
The importance of model checking was acknowledged by a Turing award in 2007, and formal methods in g...
Many systems are inherently stochastic: they interact with unpredictable environments or use randomi...
AbstractIn this paper we present a method for testing a system against a non-deterministic stochasti...
Probabilistic model checking is a formal verification technique for systems that exhibit stochastic ...
Probabilistic timed automata, a variant of timed automata extended with discrete probability distrib...
In this paper we present a method for testing a system against a non-deterministic stochastic finite...
Probabilistic timed automata are timed automata extended with discrete probabil-ity distributions, a...
. We consider the timed automata model of [3], which allows the analysis of real-time systems expres...
AbstractProbabilistic timed automata are timed automata extended with discrete probability distribut...
AbstractProbabilistic elements are often introduced in concurrent programs in order to solve problem...
Probabilistic timed automata are timed automata extended with discrete probability distributions, an...