Sciweavers

503 search results - page 11 / 101
» Probabilistic Weighted Automata
Sort
View
FOSSACS
2007
Springer
14 years 2 months ago
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
Augusto Parma, Roberto Segala
ICANN
2009
Springer
14 years 1 months ago
Computing with Probabilistic Cellular Automata
Abstract. We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic ...
Martin Schüle, Thomas Ott, Ruedi Stoop
AIPS
2006
13 years 10 months ago
Fast Probabilistic Planning through Weighted Model Counting
We present a new algorithm for probabilistic planning with no observability. Our algorithm, called Probabilistic-FF, extends the heuristic forward-search machinery of Conformant-F...
Carmel Domshlak, Jörg Hoffmann
QEST
2008
IEEE
14 years 3 months ago
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye...
FORTE
2007
13 years 10 months ago
Formal Analysis of Publish-Subscribe Systems by Probabilistic Timed Automata
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...
Fei He, Luciano Baresi, Carlo Ghezzi, Paola Spolet...