Skip to main content

Multiparty Testing Preorders

  • Conference paper
  • First Online:
Trustworthy Global Computing (TGC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9533))

Included in the following conference series:

  • 302 Accesses

Abstract

Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose two new testing preorders, which are obtained by restricting the set of potential observers. For the first preorder, called uncoordinated, we allow only sets of parallel observers that use different parts of the interface of a given service and have no possibility of intercommunication. For the second preorder, that we call independent, we instead rely on parallel observers that perceive as silent all the actions that are not in the interface of interest. We have that the uncoordinated preorder is coarser than the classical must testing preorder and finer than the independent one. We also provide a characterisation in terms of decorated traces for both preorders: the uncoordinated preorder is defined in terms of must-sets and Mazurkiewicz traces while the independent one is described in terms of must-sets and classes of filtered traces that only contain designated visible actions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Basu, S., Bultan, T., Ouederni, M.: Deciding choreography realizability. In: ACM SIGPLAN Notices, vol. 47, pp. 191–202. ACM (2012)

    Google Scholar 

  2. Bernardi, G., Hennessy, M.: Mutually testing processes. In: D’Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 – Concurrency Theory. LNCS, vol. 8052, pp. 61–75. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  3. Bravetti, M., Zavattaro, G.: Towards a unifying theory for choreography conformance and contract compliance. In: Lumpe, M., Vanderperren, W. (eds.) SC 2007. LNCS, vol. 4829, pp. 34–50. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  4. Bravetti, M., Zavattaro, G.: A foundational theory of contracts for multi-party service composition. Fundam. Informaticae 89(4), 451–478 (2008)

    MathSciNet  MATH  Google Scholar 

  5. Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. In: POPL, pp. 261–272 (2008)

    Google Scholar 

  6. Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Program. Lang. Syst. 31(5), 1–61 (2009)

    Article  MATH  Google Scholar 

  7. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122–138. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Laneve, C., Padovani, L.: The Must preorder revisited. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 212–225. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Mazurkiewicz, A.: Trace theory. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) Petri Nets: Applications and Relationships to Other Models of Concurrency. LNCS, vol. 255, pp. 278–324. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  11. Mazurkiewicz, A.W.: Introduction to trace theory. The Book of Traces pp. 3–41 (1995)

    Google Scholar 

  12. Milner, R.: Communication and Concurrency. Prentice Hall International, Hertfordshire (1989)

    MATH  Google Scholar 

  13. Mostrous, D., Yoshida, N., Honda, K.: Global principal typing in partially commutative asynchronous sessions. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 316–332. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  14. Padovani, L.: Contract-based discovery of web services modulo simple orchestrators. Theoret. Comput. Sci. 411(37), 3328–3347 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Padovani, L.: Fair subtyping for multi-party session types. In: De Meuter, W., Roman, G.-C. (eds.) COORDINATION 2011. LNCS, vol. 6721, pp. 127–141. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Takeuchi, K., Honda, K., Kubo, M.: An interaction-based language and its typing system. In: Halatsis, C., Philokyprou, G., Maritsas, D., Theodoridis, S. (eds.) PARLE 1994. LNCS, vol. 817, pp. 398–413. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

Download references

Acknowledgments

We would like to thank Maria Grazia Buscemi with whom we started investigating this topic. We have also to thank the anonymous reviewers of CONCUR and TGC 2015 for their careful reading of our manuscript and their many insightful comments and suggestions. This research has been partially supported by UBACyT 20020130200092BA and by the MIUR PRIN project CINA.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hernán Melgratti .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

De Nicola, R., Melgratti, H. (2016). Multiparty Testing Preorders. In: Ganty, P., Loreti, M. (eds) Trustworthy Global Computing. TGC 2015. Lecture Notes in Computer Science(), vol 9533. Springer, Cham. https://doi.org/10.1007/978-3-319-28766-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28766-9_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28765-2

  • Online ISBN: 978-3-319-28766-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics