Results 1  10
of
434,012
Abduction in Annotated Probabilistic Temporal Logic ∗
"... Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U % probability. ” In this paper, we develop a theory of abduc ..."
Abstract
 Add to MetaCart
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn) rules of the form “formula G becomes true K time units after formula F became true with L to U % probability. ” In this paper, we develop a theory
Probabilistic Temporal Logics via the Modal MuCalculus
 In Foundations of Software Science and Computation Structures (FOSSACS 99
, 1999
"... This paper presents a mucalculusbased modal logic for describing properties of probabilistic labeled transition systems (PLTSs) and develops a modelchecking algorithm for determining whether or not states in finitestate PTLSs satisfy formulas in the logic. The logic is based on the distinction b ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
to encode a variety of probabilistic modal and temporal logics; in addition, the modelchecking problem for it may be reduced to the calculation of solutions to systems of nonlinear equations. 1 Introduction Classical temporallogic model checking [CES86, McM93] provides a basis for automatically checking
An expectationbased model for probabilistic temporal logic
 Logic Journal of the IGPL
, 1999
"... We interpret the modal µcalculus over a new model [10], to give a temporal logic suitable for systems exhibiting both probabilistic and demonic nondeterminism. The logical formulae are realvalued, and the statements are not limited to properties that hold with probability 1. In achieving that conc ..."
Abstract

Cited by 16 (11 self)
 Add to MetaCart
We interpret the modal µcalculus over a new model [10], to give a temporal logic suitable for systems exhibiting both probabilistic and demonic nondeterminism. The logical formulae are realvalued, and the statements are not limited to properties that hold with probability 1. In achieving
Probabilistic temporal logic falsification of cyberphysical systems
 ACM Transactions on Embedded Computing Systems
"... We present a MonteCarlo optimization technique for finding system behaviors that falsify a Metric Temporal Logic (MTL) property. Our approach performs a random walk over the space of system inputs guided by a robustness metric defined by the MTL property. Robustness is guiding the search for a fal ..."
Abstract

Cited by 14 (12 self)
 Add to MetaCart
We present a MonteCarlo optimization technique for finding system behaviors that falsify a Metric Temporal Logic (MTL) property. Our approach performs a random walk over the space of system inputs guided by a robustness metric defined by the MTL property. Robustness is guiding the search for a
An ExpectationTransformer Model for Probabilistic Temporal Logic
, 1997
"... We reinterpret the modal µcalculus [16] to act over expectations rather than predicates, where expectations generalise predicates by taking states into the interval [0; 1] rather than the twopoint set {0; 1}; our interest is in the idioms of the µcalculus that correspond to operators of temporal ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
logic, in particular in establishing reasoning principles for them. Our model includes both probabilistic and demonic choice, and the interpretation exploits the characterisation [20] of probabilistic healthiness for expectation transformers to determine the algebraic properties of probabilistic next
A Probabilistic Temporal Logic Falsification of CyberPhysical Systems
"... We present a MonteCarlo optimization technique for finding system behaviors that falsify a Metric Temporal Logic (MTL) property. Our approach performs a random walk over the space of system inputs guided by a robustness metric defined by the MTL property. Robustness is guiding the search for a fals ..."
Abstract
 Add to MetaCart
We present a MonteCarlo optimization technique for finding system behaviors that falsify a Metric Temporal Logic (MTL) property. Our approach performs a random walk over the space of system inputs guided by a robustness metric defined by the MTL property. Robustness is guiding the search for a
Probabilistic Temporal Logic or: With What Probability Will the Swedish Chef Bork the Meatballs?
, 2007
"... In this paper we motivate, define and explain a probabilistic extension to CTL*, namely pCTL*. We provide examples to prove the expressive power of the probabilistic operator, as well as demonstrate the inadequacy of CTL * in dealing with real life systems. Finally, we give a brief overview of model ..."
Abstract
 Add to MetaCart
In this paper we motivate, define and explain a probabilistic extension to CTL*, namely pCTL*. We provide examples to prove the expressive power of the probabilistic operator, as well as demonstrate the inadequacy of CTL * in dealing with real life systems. Finally, we give a brief overview
Probabilistic Temporal Logic for Motion Planning with Resource Threshold Constraints
"... Abstract—Temporal logic and modelchecking are useful theoretical tools for specifying complex goals at the task level and formally verifying the performance of control policies. We are interested in tasks that involve constraints on realvalued energy resources. In particular, autonomous gliding ai ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—Temporal logic and modelchecking are useful theoretical tools for specifying complex goals at the task level and formally verifying the performance of control policies. We are interested in tasks that involve constraints on realvalued energy resources. In particular, autonomous gliding
A Probabilistic Temporal Logic with Frequency Operators and Its Model Checking
"... Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of executions satisfying some temporal properties can be quan ..."
Abstract
 Add to MetaCart
Probabilistic Computation Tree Logic (PCTL) and Continuous Stochastic Logic (CSL) are often used to describe specifications of probabilistic properties for discrete time and continuous time, respectively. In PCTL and CSL, the possibility of executions satisfying some temporal properties can
Results 1  10
of
434,012