Sciweavers

87 search results - page 5 / 18
» GSOS for Probabilistic Transition Systems
Sort
View
ENTCS
2008
115views more  ENTCS 2008»
14 years 10 months ago
Branching Bisimulation Congruence for Probabilistic Systems
The notion of branching bisimulation for the alternating model of probabilistic systems is not a congruence with respect to parallel composition. In this paper we first define ano...
Nikola Trcka, Sonja Georgievska
FOSSACS
2011
Springer
14 years 1 months ago
Similarity Quotients as Final Coalgebras
We give a general framework connecing a branching time relation on nodes of a transition system to a final coalgebra for a suitable endofunctor. Examples of relations treated by o...
Paul Blain Levy
LICS
2003
IEEE
15 years 3 months ago
Model checking for probability and time: from theory to practice
Probability features increasingly often in software and hardware systems: it is used in distributed co-ordination and routing problems, to model fault-tolerance and performance, a...
Marta Z. Kwiatkowska
ENTCS
2006
273views more  ENTCS 2006»
14 years 10 months ago
Operator Algebras and the Operational Semantics of Probabilistic Languages
We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
Alessandra Di Pierro, Herbert Wiklicky
KI
2009
Springer
15 years 4 months ago
Maximum a Posteriori Estimation of Dynamically Changing Distributions
This paper presents a sequential state estimation method with arbitrary probabilistic models expressing the system’s belief. Probabilistic models can be estimated by Maximum a po...
Michael Volkhardt, Sören Kalesse, Steffen M&u...