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].
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

Contributor : Hal Ifip <>
Submitted on : Wednesday, December 6, 2017 - 3:47:18 PM
Last modification on : Friday, January 4, 2019 - 5:33:35 PM


 Restricted access
To satisfy the distribution rights of the publisher, the document is embargoed until : 2020-01-01

Please log in to resquest access to the document


Distributed under a Creative Commons Attribution 4.0 International License



Giovanni Bernardi, Adrian Francalanza. Full-Abstraction for Must Testing Preorders. 19th International Conference on Coordination Languages and Models (COORDINATION), Jun 2017, Neuchâtel, Switzerland. pp.237-255, ⟨10.1007/978-3-319-59746-1_13⟩. ⟨hal-01657337⟩



Record views