Sciweavers

160 search results - page 7 / 32
» Probabilistic Model Checking and Reliability of Results
Sort
View
QEST
2010
IEEE
13 years 5 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 1 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
CORR
2011
Springer
165views Education» more  CORR 2011»
13 years 2 months ago
The Impact of Memory Models on Software Reliability in Multiprocessors
The memory consistency model is a fundamental system property characterizing a multiprocessor. The relative merits of strict versus relaxed memory models have been widely debated ...
Alexander Jaffe, Thomas Moscibroda, Laura Effinger...
FORTE
2007
13 years 9 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...
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ö...