Results 1  10
of
128
Verifying quantitative properties of continuous probabilistic timed automata
, 2000
"... Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in [19], an extension of the timed automata model of [4], with clock resets made according to continuous probability distri ..."
Abstract

Cited by 45 (9 self)
 Add to MetaCart
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in [19], an extension of the timed automata model of [4], with clock resets made according to continuous probability
Verifying Linear Duration Properties of Probabilistic RealTime Systems
, 1999
"... In this paper we present a method for deciding whether a probabilistic realtime system, modelled as a Markov chain, satisfies a linear duration property at a given time interval with a given lower bound of the probability. With this method we can reduce the problem into a finite number of integer l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we present a method for deciding whether a probabilistic realtime system, modelled as a Markov chain, satisfies a linear duration property at a given time interval with a given lower bound of the probability. With this method we can reduce the problem into a finite number of integer
Proving Performance Properties (even Probabilistic Ones)
, 1994
"... This paper surveys some new tools and methods for formally verifying time performance properties of systems that satisfy timing assumptions. The techniques are potentially of practical benefit in the validation of realtime process control and communication systems. The tools and methods include non ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper surveys some new tools and methods for formally verifying time performance properties of systems that satisfy timing assumptions. The techniques are potentially of practical benefit in the validation of realtime process control and communication systems. The tools and methods include
On the Verification of Nondeterministic Automata Specifications of Probabilistic RealTime Systems
, 1999
"... In [2], Alur et al. presented an algorithm for the problem of verifying deterministic timed automata specifications of probabilistic realtime systems given as generalized semiMarkov processes; and posed the question of the verification of nondeterministic specifications. We give a partial answer t ..."
Abstract
 Add to MetaCart
In [2], Alur et al. presented an algorithm for the problem of verifying deterministic timed automata specifications of probabilistic realtime systems given as generalized semiMarkov processes; and posed the question of the verification of nondeterministic specifications. We give a partial answer
Pareto curves for probabilistic model checking
 In Proc. 10th International Symposium on Automated Technology for Verification and Analysis (ATVA’12), LNCS
, 2012
"... Abstract. Multiobjective probabilistic model checking provides a way to verify several, possibly conflicting, quantitative properties of a stochastic system. It has useful applications in controller synthesis and compositional probabilistic verification. However, existing methods are based on linea ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Abstract. Multiobjective probabilistic model checking provides a way to verify several, possibly conflicting, quantitative properties of a stochastic system. It has useful applications in controller synthesis and compositional probabilistic verification. However, existing methods are based
Verification and Control of Partially Observable Probabilistic RealTime Systems
"... Abstract. We propose automated techniques for the verification and control of probabilistic realtime systems that are only partially observable. To formally model such systems, we define an extension of probabilistic timed automata in which local states are partially visible to an observer or con ..."
Abstract
 Add to MetaCart
Abstract. We propose automated techniques for the verification and control of probabilistic realtime systems that are only partially observable. To formally model such systems, we define an extension of probabilistic timed automata in which local states are partially visible to an observer
Efficient Probabilistically Checkable Debates
"... Probabilistically checkable debate systems (PCDSs) are debates between two competing provers, in which a polynomialtime verifier inspects a constant number of bits of the debate. It was shown by Condon, Feigenbaum, Lund, and Shor that every language in PSPACE has a PCDS in which the debate length ..."
Abstract
 Add to MetaCart
Probabilistically checkable debate systems (PCDSs) are debates between two competing provers, in which a polynomialtime verifier inspects a constant number of bits of the debate. It was shown by Condon, Feigenbaum, Lund, and Shor that every language in PSPACE has a PCDS in which the debate length
Bounded model checking of hybrid dynamical system
 IN: PROCEEDINGS OF THE 44RD CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDCECC’05
, 2005
"... Bounded model checking (BMC) has recently emerged as a very powerful methodology for the verification of purely discrete systems. Given a horizon of interest, bounded model checking verifies whether all finitehorizon trajectories satisfy a temporal logic formula by first translating the problem to ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Bounded model checking (BMC) has recently emerged as a very powerful methodology for the verification of purely discrete systems. Given a horizon of interest, bounded model checking verifies whether all finitehorizon trajectories satisfy a temporal logic formula by first translating the problem
c © E. CormieBowins and F. van Breugel Measuring Progress of Probabilistic LTL Model Checking
"... Recently, Zhang and Van Breugel introduced the notion of a progress measure for a probabilistic model checker. Given a lineartime property φ and a description of the part of the system that has already been checked, the progress measure returns a real number in the unit interval. The real number ca ..."
Abstract
 Add to MetaCart
Recently, Zhang and Van Breugel introduced the notion of a progress measure for a probabilistic model checker. Given a lineartime property φ and a description of the part of the system that has already been checked, the progress measure returns a real number in the unit interval. The real number
Statistical Model Checking for Distributed ProbabilisticControl Hybrid Automata with Smart Grid Applications
, 2011
"... This technical report is a more detailed version of a published paper [12]. The power industry is currently moving towards a more dynamical, intelligent power grid. This Smart Grid is still in its infancy and a formal evaluation of the expensive technologies and ideas on the table is necessary befor ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
before committing to a full investment. In this paper, we argue that a good model for the Smart Grid must match its basic properties: it must be hybrid (both evolve over time, and perform control/computation), distributed (multiple concurrently executing entities), and allow for asynchronous
Results 1  10
of
128