Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Journal of the ACM (JACM)
Observation equivalence as a testing equivalence
Theoretical Computer Science
Testing equivalences and fully abstract models for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Equivalences, congruences, and complete axiomatizations for probabilistic processes
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Bisimulation through probabilistic testing
Information and Computation
Reactive, generative, and stratified models of probabilistic processes
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Testing preorders for probabilistic processes
Information and Computation
Communication and Concurrency
Performance measure sensitive congruences for Markovian process algebras
Theoretical Computer Science
Discrete time generative-reactive probabilistic processes with different advancing speeds
Theoretical Computer Science
Modal Logic Characterization of Markovian Testing and Trace Equivalences
Electronic Notes in Theoretical Computer Science (ENTCS)
Trace Machines for Observing Continuous-Time Markov Chains
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
A survey of Markovian behavioral equivalences
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
Weighted lumpability on markov chains
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Hi-index | 0.00 |
Behavioural equivalences are a means of establishing whether computing systems possess the same properties. The specific set of properties that are preserved by a specific behavioural equivalence clearly depends on how the system behaviour is observed and can usually be characterised by means of a modal logic. In this paper we consider three different approaches to the definition of behavioural equivalences – bisimulation, testing and trace – applied to three different classes of systems – non-deterministic, probabilistic and Markovian – and we survey the nine resulting modal logic characterisations, each of which stems from the Hennessy–Milner logic. We then compare the nine characterisations with respect to the logical operators, in order to emphasise the differences between the three approaches in the definition of behavioural equivalences and the regularities within each of them. In the probabilistic and Markovian cases we also address the issue of whether the probabilistic and temporal aspects should be treated in a local or global way and consequently whether the modal logic interpretation should be qualitative or quantitative.