%0 Conference Proceedings
%T Full-Abstraction for Must Testing Preorders
%+ Université Paris Diderot - Paris 7 (UPD7)
%+ University of Malta [Malta]
%A Bernardi, Giovanni
%A Francalanza, Adrian
%Z Part 5: Verification
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 19th International Conference on Coordination Languages and Models (COORDINATION)
%C Neuchâtel, Switzerland
%Y Jean-Marie Jacquet
%Y Mieke Massink
%I Springer International Publishing
%3 Coordination Models and Languages
%V LNCS-10319
%P 237-255
%8 2017-06-19
%D 2017
%R 10.1007/978-3-319-59746-1_13
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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].
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01657337/document
%2 https://inria.hal.science/hal-01657337/file/450044_1_En_13_Chapter.pdf
%L hal-01657337
%U https://inria.hal.science/hal-01657337
%~ UNIV-PARIS7
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-COORDINATION
%~ USPC
%~ IFIP-LNCS-10319
%~ UNIV-PARIS