87 search results - page 12 / 18 » GSOS for Probabilistic Transition Systems |
APLAS
2007
ACM
15 years 2 months ago
2007
ACM
This paper studies types and probabilistic bisimulations for a timed -calculus as an effective tool for a compositional analysis of probabilistic distributed behaviour. The types c...
119
click to vote
DAC
1994
ACM
15 years 1 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
ENTCS
2007
14 years 10 months ago
2007
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We propose a framework to translate certain subclasses of differential equation systems into distributed protocols that are practical. The synthesized protocols are state machine...
ENTCS
2007
14 years 10 months ago
2007
We define a logic EpCTL for reasoning about the evolution of probabilistic systems. System states correspond to probability distributions over classical states and the system evo...