Uniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes

Authors:
Marco Bernardo
Affiliations:
Università di Urbino “Carlo Bo” -- Italy, Istituto di Scienze e Tecnologie dell'Informazione
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 19
Cited 2

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
Acceptance trees

Journal of the ACM (JACM)
Extensional equivalence for transition systems

Acta Informatica
Observation equivalence as a testing equivalence

Theoretical Computer Science
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

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
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Testing Equivalences and Fully Abstract Models for Probabilistic Processes

CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Compositional Verification of Probabilistic Processes

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Bisimulation for labelled Markov processes

Information and Computation - Special issue: LICS'97
Characterising Testing Preorders for Finite Probabilistic Processes

LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A survey of modal logics characterising behavioural equivalences for non-deterministic and stochastic systems

Mathematical Structures in Computer Science
Logical characterizations of bisimulations for discrete probabilistic systems

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures

Weighted lumpability on markov chains

PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely on similar modal languages, each including only true and diamond. Unfortunately, this is not the case with the existing logical characterizations of the corresponding variants of testing equivalence, as they are based on different modal languages. In this paper we show that the logical characterizations of testing equivalences for fully nondeterministic processes, fully probabilistic processes, and fully Markovian processes without silent moves can be harmonized by means of a modal language comprising true, disjunction, and diamond.