35,283 research outputs found
Real-Reward Testing for Probabilistic Processes (Extended Abstract)
We introduce a notion of real-valued reward testing for probabilistic
processes by extending the traditional nonnegative-reward testing with negative
rewards. In this richer testing framework, the may and must preorders turn out
to be inverses. We show that for convergent processes with finitely many states
and transitions, but not in the presence of divergence, the real-reward
must-testing preorder coincides with the nonnegative-reward must-testing
preorder. To prove this coincidence we characterise the usual resolution-based
testing in terms of the weak transitions of processes, without having to
involve policies, adversaries, schedulers, resolutions, or similar structures
that are external to the process under investigation. This requires
establishing the continuity of our function for calculating testing outcomes.Comment: In Proceedings QAPL 2011, arXiv:1107.074
Characterising Probabilistic Processes Logically
In this paper we work on (bi)simulation semantics of processes that exhibit
both nondeterministic and probabilistic behaviour. We propose a probabilistic
extension of the modal mu-calculus and show how to derive characteristic
formulae for various simulation-like preorders over finite-state processes
without divergence. In addition, we show that even without the fixpoint
operators this probabilistic mu-calculus can be used to characterise these
behavioural relations in the sense that two states are equivalent if and only
if they satisfy the same set of formulae.Comment: 18 page
Riordan Paths and Derangements
Riordan paths are Motzkin paths without horizontal steps on the x-axis. We
establish a correspondence between Riordan paths and
-avoiding derangements. We also present a combinatorial proof
of a recurrence relation for the Riordan numbers in the spirit of the
Foata-Zeilberger proof of a recurrence relation on the Schr\"oder numbers.Comment: 9 pages, 2 figure
- …