Sciweavers

87 search results - page 7 / 18
» GSOS for Probabilistic Transition Systems
Sort
View
QEST
2007
IEEE
15 years 4 months ago
Qualitative Logics and Equivalences for Probabilistic Systems
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...
Luca de Alfaro, Krishnendu Chatterjee, Marco Faell...
ENTCS
2006
99views more  ENTCS 2006»
14 years 10 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...
VMCAI
2004
Springer
15 years 3 months ago
Approximate Probabilistic Model Checking
In this paper we deal with the problem of applying model checking to real programs. We verify a program without constructing the whole transition system using a technique based on...
Thomas Hérault, Richard Lassaigne, Fr&eacut...
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
15 years 4 months ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
FOSSACS
2012
Springer
13 years 5 months ago
Synthesizing Probabilistic Composers
Synthesis from components is the automated construction of a composite system from a library of reusable components such that the system satisfies the given specification. This i...
Sumit Nain, Moshe Y. Vardi