Sciweavers

18 search results - page 3 / 4
» Exogenous Probabilistic Computation Tree Logic
Sort
View
QEST
2005
IEEE
14 years 1 months ago
iLTLChecker: A Probabilistic Model Checker for Multiple DTMCs
iLTL is a probabilistic temporal logic that can specify properties of multiple discrete time Markov chains (DTMCs). In this paper, we describe two related tools: MarkovEstimator a...
YoungMin Kwon, Gul A. Agha
ICDE
2005
IEEE
126views Database» more  ICDE 2005»
14 years 9 months ago
A Probabilistic XML Approach to Data Integration
In mobile and ambient environments, devices need to become autonomous, managing and resolving problems without interference from a user. The database of a (mobile) device can be s...
Maurice van Keulen, Ander de Keijzer, Wouter Alink
ENTCS
2006
134views more  ENTCS 2006»
13 years 8 months ago
Partial Order Reduction for Probabilistic Branching Time
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...
Christel Baier, Pedro R. D'Argenio, Marcus Grö...
BIRTHDAY
2010
Springer
14 years 22 days ago
The Arrow of Time through the Lens of Computing
Egon Börger Ambient Abstract State Machines with Applications 11:00 AM Manfred Broy Realizability of System Interface Specifications 11:30 AM Ofer Strichman Proving Equivalence be...
Krishna V. Palem
HYBRID
2010
Springer
14 years 2 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...