Arrow Research search
Back to I&C

I&C 1999

Basic Observables for Processes

Journal Article journal-article Computer Science ยท Theoretical Computer Science

Abstract

A general approach for defining behavioral preorders over process terms as the maximal precongruences induced by basic observables is examined. Three different observables that provide information about the initial communication capabilities of processes and about the possibility that processes get engaged in divergent computations will be considered. We show that the precongruences induced by our basic observables coincide with intuitive and/or widely studied behavioral preorders. In particular, we retrieve in our setting themust preorderof De Nicola and Hennessy and thefair/should preorderintroduced by Cleaveland and Natarajan and by Brinksma, Rensink, and Vogler. A new form of testing preorder, which we callsafe-must, also emerges. The alternative characterizations we offer shed light on the differences between these pre- orders and on the role played in their definition by tests for divergence.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
759064596472199183
v2026.09.13