Modal Logic Characterization of Markovian Testing and Trace Equivalences

Authors:
Marco Bernardo;Stefania Botta
Affiliations:
Università di Urbino “Carlo Bo”, Istituto di Scienze e Tecnologie dell'Informazione, Piazza della Repubblica 13, 61029 Urbino, Italy;Università di Urbino “Carlo Bo”, Istituto di Scienze e Tecnologie dell'Informazione, Piazza della Repubblica 13, 61029 Urbino, Italy
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2007

Citing 5
Cited 1

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Acceptance trees

Journal of the ACM (JACM)
A compositional approach to performance modelling

A compositional approach to performance modelling
Performance measure sensitive congruences for Markovian process algebras

Theoretical Computer Science
Trace Machines for Observing Continuous-Time Markov Chains

Electronic Notes in Theoretical Computer Science (ENTCS)

A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Markovian testing and trace equivalences have been recently proposed as reasonable alternatives to Markovian bisimilarity, as both of them induce at the Markov chain level an aggregation strictly coarser than ordinary lumping that is still exact. In this paper we provide a modal logic characterization for each of the two non-bisimulation-based Markovian behavioral equivalences, which relies on a quantitative interpretation of a variant of the Hennessy-Milner logic. We also show that, unlike the Markovian bisimilarity case, such modal logic characterizations exist only when probabilistic and temporal aspects are treated in a global way.