Sciweavers

87 search results - page 14 / 18
» GSOS for Probabilistic Transition Systems
Sort
View
FMCAD
2004
Springer
15 years 1 months ago
Bloom Filters in Probabilistic Verification
Abstract. Probabilistic techniques for verification of finite-state transition systems offer huge memory savings over deterministic techniques. The two leading probabilistic scheme...
Peter C. Dillinger, Panagiotis Manolios
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...
ENTCS
2008
146views more  ENTCS 2008»
14 years 10 months ago
Probabilistic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions
istic Abstract Interpretation of Imperative Programs using Truncated Normal Distributions Michael J. A. Smith1 ,2 Laboratory for Foundations of Computer Science University of Edinb...
Michael J. A. Smith
TCS
2002
14 years 9 months ago
Automatic verification of real-time systems with discrete probability distributions
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
Marta Z. Kwiatkowska, Gethin Norman, Roberto Segal...
ACL
1998
14 years 11 months ago
Context Management with Topics for Spoken Dialogue Systems
In this paper we discuss the use of discourse context in spoken dialogue systems and argue that the knowledge of the domain, modelled with the help of dialogue topics is important...
Kristiina Jokinen, Hideki Tanaka