98 search results - page 8 / 20 » Weak Bisimulation for Probabilistic Systems |
92
Voted
ENTCS
2006
15 years 1 months ago
2006
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural...
IFIPTCS
2000
15 years 5 months ago
2000
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
90
Voted
SEFM
2006
IEEE
15 years 7 months ago
2006
IEEE
In this paper, we give a straightforward generalization of bisimulations to "bisimulations induced by a pair of relations" on the underlying action set. We establish tha...
150
Voted
CONCUR
2003
Springer
15 years 7 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
141
click to vote
MEMOCODE
2008
IEEE
15 years 8 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...