Sciweavers

13917 search results - page 43 / 2784
» Abstraction of Probabilistic Systems
Sort
View
IANDC
2010
116views more  IANDC 2010»
14 years 8 months ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
CONCUR
2006
Springer
15 years 1 months ago
Probability and Nondeterminism in Operational Models of Concurrency
We give a brief overview of operational models for concurrent systems that exhibit probabilistic behavior, focussing on the interplay between probability and nondeterminism. Our su...
Roberto Segala
FOSSACS
1999
Springer
15 years 2 months ago
Probabilistic Temporal Logics via the Modal Mu-Calculus
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
Murali Narasimha, Rance Cleaveland, S. Purushotham...
CN
2004
121views more  CN 2004»
14 years 9 months ago
Probabilistic fault diagnosis in communication systems through incremental hypothesis updating
This paper presents a probabilistic event-driven fault localization technique, which uses a probabilistic symptomfault map as a fault propagation model. The technique isolates the...
Malgorzata Steinder, Adarshpal S. Sethi
CONCUR
2009
Springer
15 years 4 months ago
Concavely-Priced Probabilistic Timed Automata
Abstract. Concavely-priced probabilistic timed automata, an extension of probabilistic timed automata, are introduced. In this paper we consider expected reachability, discounted, ...
Marcin Jurdzinski, Marta Z. Kwiatkowska, Gethin No...