# Full-Abstraction for Must Testing Preorders

Abstract : The client ${\mathsf {must}}$ preorder relates tests (clients) instead of processes (servers). The existing characterisation of this preorder is unsatisfactory for it relies on the notion of usable clients which, in turn, are defined using an existential quantification over the servers that ensure client satisfaction. In this paper we characterise the set of usable clients for finite-branching LTSs, and give a sound and complete decision procedure for it. We also provide a novel coinductive characterisation of the client preorder, which we use to argue that the preorder is decidable, thus positively answering the question opened in [3, 6].
Type de document :
Communication dans un congrès
Jean-Marie Jacquet; Mieke Massink. 19th International Conference on Coordination Languages and Models (COORDINATION), Jun 2017, Neuchâtel, Switzerland. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10319, pp.237-255, 2017, Coordination Models and Languages. 〈10.1007/978-3-319-59746-1_13〉
Domaine :
Liste complète des métadonnées

Littérature citée [31 références]

https://hal.inria.fr/hal-01657337
Contributeur : Hal Ifip <>
Soumis le : mercredi 6 décembre 2017 - 15:47:18
Dernière modification le : vendredi 8 décembre 2017 - 01:17:52

### Fichier

##### Accès restreint
Fichier visible le : 2020-01-01

Connectez-vous pour demander l'accès au fichier

### Licence

Distributed under a Creative Commons Paternité 4.0 International License

### Citation

Giovanni Bernardi, Adrian Francalanza. Full-Abstraction for Must Testing Preorders. Jean-Marie Jacquet; Mieke Massink. 19th International Conference on Coordination Languages and Models (COORDINATION), Jun 2017, Neuchâtel, Switzerland. Springer International Publishing, Lecture Notes in Computer Science, LNCS-10319, pp.237-255, 2017, Coordination Models and Languages. 〈10.1007/978-3-319-59746-1_13〉. 〈hal-01657337〉

### Métriques

Consultations de la notice