Basic observables for processes [chapter]

Michele Boreale, Rocco Nicola, Rosario Pugliese
1997 Lecture Notes in Computer Science  
A general approach for de ning behavioural preorders over process terms as the maximal pre{congruences induced by basic observables is examined. Three di erent 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 pre{congruences induced by our basic observables coincide with intuitive and/or widely studied behavioural preorders. In
more » ... ular, we retrieve in our setting the must preorder of De Nicola and Hennessy and the fair/should preorder introduced by Cleaveland and Natarajan and by Brinksma, Rensink and Vogler. A new form of testing preorder, which we call safe{must, also emerges. The alternative characterizations we o er shed light on the di erences between these preorders, and on the rôle played in their de nition by tests for divergence.
doi:10.1007/3-540-63165-8_204 fatcat:3hjiwvqspfcyvn7hlb5zzdb3qa