Full-Abstraction for Must Testing Preorders - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Full-Abstraction for Must Testing Preorders

(1) , (2)
1
2
Giovanni Bernardi
  • Function : Author
  • PersonId : 1024623
Adrian Francalanza
  • Function : Author
  • PersonId : 1024624

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].
Fichier principal
Vignette du fichier
450044_1_En_13_Chapter.pdf (198.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01657337 , version 1 (06-12-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
94 View
70 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More