Results 1  10
of
63
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
 In Proceedings of the 20th International Conference on Concurrency Theory
, 2009
"... Abstract. We propose a way of presenting and computing a counterexample in probabilistic LTL model checking for discretetime Markov chains. In qualitative probabilistic model checking, we present a counterexample as a pair (α,γ), where α,γ are finite words such that all paths that extend α and hav ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. We propose a way of presenting and computing a counterexample in probabilistic LTL model checking for discretetime Markov chains. In qualitative probabilistic model checking, we present a counterexample as a pair (α,γ), where α,γ are finite words such that all paths that extend α
A Monte Carlo Model Checker for Probabilistic LTL with Numerical Constraints
"... We define the syntax and semantics of a new temporal logic called probabilistic LTL with numerical constraints (PLTLc). We introduce an efficient model checker for PLTLc properties. The efficiency of the model checker is through approximation using Monte Carlo sampling of finite paths through the mo ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
We define the syntax and semantics of a new temporal logic called probabilistic LTL with numerical constraints (PLTLc). We introduce an efficient model checker for PLTLc properties. The efficiency of the model checker is through approximation using Monte Carlo sampling of finite paths through
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
Probabilistic Büchi Automata for LTL\GU
"... Abstract. LTL\GU is a fragment of linear temporal logic (LTL), where negations appear only on propositions, and formulas are built using the temporal operators X (next), F (eventually), G (always), and U (until, with the restriction that no until operator occurs in the scope of an always operator. ..."
Abstract
 Add to MetaCart
Abstract. LTL\GU is a fragment of linear temporal logic (LTL), where negations appear only on propositions, and formulas are built using the temporal operators X (next), F (eventually), G (always), and U (until, with the restriction that no until operator occurs in the scope of an always operator
LTL Control in Uncertain Environments with Probabilistic Satisfaction Guarantees
"... Abstract: We present a method to generate a robot control strategy that maximizes the probability to accomplish a task. The task is given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied at the regions of a partitioned environment. We assume that the probabili ..."
Abstract
 Add to MetaCart
Abstract: We present a method to generate a robot control strategy that maximizes the probability to accomplish a task. The task is given as a Linear Temporal Logic (LTL) formula over a set of properties that can be satisfied at the regions of a partitioned environment. We assume
Randomization Helps in LTL Model Checking
, 2001
"... We present and analyze a new probabilistic method for automata based LTL model checking of nonprobabilistic systems with intention to reduce memory requirements. The main idea of our approach is to use randomness to decide which of the needed information (visited states) should be stored during a c ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We present and analyze a new probabilistic method for automata based LTL model checking of nonprobabilistic systems with intention to reduce memory requirements. The main idea of our approach is to use randomness to decide which of the needed information (visited states) should be stored during a
An Optimal Automata Approach to LTL Model . . .
 In Proceedings of LPAR 2003
, 2003
"... Most verication problems on nite systems may be formulated and solved optimally using automata based techniques. Nonetheless LTL verication of (nite) probabilistic systems, i.e. deciding whether a probabilistic system almost surely satises an LTL formula, remains one of the few exceptions to thi ..."
Abstract
 Add to MetaCart
Most verication problems on nite systems may be formulated and solved optimally using automata based techniques. Nonetheless LTL verication of (nite) probabilistic systems, i.e. deciding whether a probabilistic system almost surely satises an LTL formula, remains one of the few exceptions
A probabilistic approach for control of a stochastic system from LTL specifications
 In IEEE Conf. on Decision and Control
, 2009
"... Abstract — We consider the problem of controlling a continuoustime linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicates in the state of the system. We propose a threestep symbolic approach. First, we define a polyhedral partit ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
Abstract — We consider the problem of controlling a continuoustime linear stochastic system from a specification given as a Linear Temporal Logic (LTL) formula over a set of linear predicates in the state of the system. We propose a threestep symbolic approach. First, we define a polyhedral
LTL path checking is efficiently parallelizable
 Proc. 36th Int. Conf. Autom. Lang. Program., Part II, Rhodes (Susanne Albers, Alberto MarchettiSpaccamela, Yossi Matias, Sotiris E. Nikoletseas and Wolfgang Thomas, eds.), LNCS 5556, 235– 246, 2009. Leslie Lamport. ‘Sometime’ is sometimes ‘not never’, Pr
"... Abstract. We present an AC 1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a foundation for the parallelization of various applications in monitoring, testing, and verification. Linearti ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. We present an AC 1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a foundation for the parallelization of various applications in monitoring, testing, and verification. Linear
Results 1  10
of
63