Sciweavers

61 search results - page 8 / 13
» Logical Characterizations of Bisimulations for Discrete Prob...
Sort
View
ENTCS
2006
134views more  ENTCS 2006»
13 years 7 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ö...
TCS
2002
13 years 7 months ago
Automatic verification of real-time systems with discrete probability distributions
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ENTCS
2002
152views more  ENTCS 2002»
13 years 7 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano
FORMATS
2004
Springer
14 years 1 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
IRFC
2010
Springer
13 years 5 months ago
An Information Retrieval Model Based on Discrete Fourier Transform
Abstract. Information Retrieval (IR) systems combine a variety of techniques stemming from logical, vector-space and probabilistic models. This variety of combinations has produced...
Alberto Costa, Massimo Melucci