102 search results - page 15 / 21 » Symbolic Model Checking for Probabilistic Processes |
TNN
1998
14 years 11 months ago
1998
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
127
click to vote
CORR
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
SBMF
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
QEST
2005
IEEE
15 years 5 months ago
2005
IEEE
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...
102
click to vote
ISOLA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. This paper presents a formal analysis of the device discovery phase of the Bluetooth wireless communication protocol. The performance of this process is the result of a c...