Sciweavers

169 search results - page 27 / 34
» Temporalization of Probabilistic Propositional Logic
Sort
View
CPAIOR
2006
Springer
15 years 4 months ago
An Efficient Hybrid Strategy for Temporal Planning
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
Zhao Xing, Yixin Chen, Weixiong Zhang
TACAS
2004
Springer
132views Algorithms» more  TACAS 2004»
15 years 5 months ago
Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study
Numerical analysis based on uniformisation and statistical techniques based on sampling and simulation are two distinct approaches for transient analysis of stochastic systems. We ...
Håkan L. S. Younes, Marta Z. Kwiatkowska, Ge...
JSAI
2005
Springer
15 years 5 months ago
Learning Stochastic Logical Automaton
Abstract. This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic mode...
Hiroaki Watanabe, Stephen Muggleton
FORMATS
2003
Springer
15 years 5 months ago
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
TACAS
2000
Springer
138views Algorithms» more  TACAS 2000»
15 years 3 months ago
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent...
Luca de Alfaro, Marta Z. Kwiatkowska, Gethin Norma...