391 search results - page 17 / 79 » Compositionality for Probabilistic Automata |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
CSFW
2007
IEEE
14 years 2 months ago
2007
IEEE
We study simulation relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation lengths are polynomially bounded. T...
EPEW
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...
ENTCS
2008
13 years 8 months ago
2008
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...
ASIAN
2003
Springer
14 years 1 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...