%0 Book Section
%A Boreale, Michele
%A De Nicola, Rocco
%A Pugliese, Rosario
%B Automata, Languages and Programming (ICALP 1997)
%D 1997
%E Degano, Pierpaolo
%E Gorrieri, Roberto
%E Marchetti-Spaccamela, Alberto
%F eprints:353
%I Springer
%P 482-492
%S Lecture Notes in Computer Science
%T Basic Observables for Processes
%U http://eprints.imtlucca.it/353/
%V 1256
%X We propose a general approach to define behavioural preorders over process terms by considering the pre-congruences induced by three basic observables. These observables provide information about the initial communication capabilities of processes and about their possibility of engaging in an infinite internal chattering. We show that some of the observables-based pre-congruences do correspond to behavioral preorders long studied in the literature. The coincidence proofs shed light on the differences between the must preorder of De Nicola and Hennessy and the fair/should preorder of Cleaveland and Natarajan and of Brinksma, Rensink and Vogler, and on the rôle played in their definition by tests for internal chattering.