Sciweavers

41 search results - page 7 / 9
» Bisimulation and cocongruence for probabilistic systems
Sort
View
TGC
2010
Springer
13 years 5 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
ENTCS
1998
115views more  ENTCS 1998»
13 years 7 months ago
A Testing Equivalence for Reactive Probabilistic Processes
We consider a generalisation of Larsen and Skou’s [19] reactive probabilistic transition systems which exhibit three kinds of choice: action-guarded probabilistic choice, extern...
Marta Z. Kwiatkowska, Gethin Norman
QEST
2009
IEEE
14 years 2 months ago
The Ins and Outs of the Probabilistic Model Checker MRMC
The Markov Reward Model Checker (MRMC) is a software tool for verifying properties over probabilistic models. It supports PCTL and CSL model checking, and their reward extensions....
Joost-Pieter Katoen, Ivan S. Zapreev, Ernst Moritz...
ENTCS
2006
99views more  ENTCS 2006»
13 years 7 months ago
Metrics for Action-labelled Quantitative Transition Systems
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural...
Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun...
ICALP
2011
Springer
12 years 11 months ago
On the Semantics of Markov Automata
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...
Yuxin Deng, Matthew Hennessy