Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Realisability of Branching Pomsets

  • Conference paper
  • First Online:
Formal Aspects of Component Software (FACS 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13712))

Included in the following conference series:

Abstract

A communication protocol is realisable if it can be faithfully implemented in a distributed fashion by communicating agents. Pomsets offer a way to compactly represent concurrency in communication protocols and have been recently used for the purpose of realisability analysis. In this paper we focus on the recently introduced branching pomsets, which also compactly represent choices. We define well-formedness conditions on branching pomsets, inspired by multiparty session types, and we prove that the well-formedness of a branching pomset is a sufficient condition for the realisability of the represented communication protocol.

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

Access this chapter

Log in via an institution

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
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    Technically and have different events and should thus be isomorphic rather than precisely equal. We choose to write it as an equality to not unnecessarily complicate the definition and proofs.

References

  1. Alur, R., Etessami, K., Yannakakis, M.: Inference of message sequence charts. IEEE Trans. Software Eng. 29(7), 623–633 (2003). https://doi.org/10.1109/TSE.2003.1214326

    Article  Google Scholar 

  2. Alur, R., Etessami, K., Yannakakis, M.: Realizability and verification of MSC graphs. Theor. Comput. Sci. 331(1), 97–114 (2005). https://doi.org/10.1016/j.tcs.2004.09.034

    Article  Google Scholar 

  3. Basu, S., Bultan, T., Ouederni, M.: Deciding choreography realizability. In: Field, J., Hicks, M. (eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA, 22–28 January 2012, pp. 191–202. ACM (2012). https://doi.org/10.1145/2103656.2103680

  4. Bocchi, L., Melgratti, H., Tuosto, E.: Resolving non-determinism in choreographies. In: Shao, Z. (ed.) ESOP 2014. LNCS, vol. 8410, pp. 493–512. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-642-54833-8_26

    Chapter  Google Scholar 

  5. Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983). https://doi.org/10.1145/322374.322380

    Article  Google Scholar 

  6. Carbone, M., Yoshida, N., Honda, K.: Asynchronous session types: exceptions and multiparty interactions. In: Bernardo, M., Padovani, L., Zavattaro, G. (eds.) SFM 2009. LNCS, vol. 5569, pp. 187–212. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01918-0_5

    Chapter  Google Scholar 

  7. Castagna, G., Dezani-Ciancaglini, M., Padovani, L.: On global types and multi-party session. Log. Methods Comput. Sci. 8(1) (2012). https://doi.org/10.2168/LMCS-8(1:24)2012

  8. Castellani, I., Dezani-Ciancaglini, M., Giannini, P.: Event structure semantics for multiparty sessions. In: Boreale, M., Corradini, F., Loreti, M., Pugliese, R. (eds.) Models, Languages, and Tools for Concurrent and Distributed Programming. LNCS, vol. 11665, pp. 340–363. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-21485-2_19

    Chapter  Google Scholar 

  9. Castellani, I., Dezani-Ciancaglini, M., Giannini, P.: Reversible sessions with flexible choices. Acta Informatica 56(7), 553–583 (2019). https://doi.org/10.1007/s00236-019-00332-y

    Article  Google Scholar 

  10. Deniélou, P.-M., Yoshida, N.: Multiparty session types meet communicating automata. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 194–213. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-28869-2_10

    Chapter  Google Scholar 

  11. Deniélou, P., Yoshida, N., Bejleri, A., Hu, R.: Parameterised multiparty session types. Log. Methods Comput. Sci. 8(4) (2012). https://doi.org/10.2168/LMCS-8(4:6)2012

  12. Edixhoven, L., Jongmans, S.S.: Realisability of branching pomsets (technical report), Tech. Rep. OUNL-CS-2022-05, Open University of the Netherlands (2022)

    Google Scholar 

  13. Edixhoven, L., Jongmans, S.S., Proença, J., Cledou, G.: Branching pomsets for choreographies. In: Proceedings 15th Interaction and Concurrency Experience, ICE 2022, Lucca, Italy, 17 June 2022, EPTCS (2022). https://doi.org/10.48550/arXiv.2208.04632

  14. Ferrari, G.L., Gorrieri, R., Montanari, U.: An extended expansion theorem. In: Abramsky, S., Maibaum, T.S.E. (eds.) TAPSOFT 1991. LNCS, vol. 494, pp. 29–48. Springer, Heidelberg (1991). https://doi.org/10.1007/3540539816_56

    Chapter  Google Scholar 

  15. Finkel, A., Lozes, É.: Synchronizability of communicating finite state machines is not decidable. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10–14 July 2017, Warsaw, Poland. LIPIcs, vol. 80, pp. 1–14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017). https://doi.org/10.4230/LIPIcs.ICALP.2017.122

  16. Fu, X., Bultan, T., Su, J.: Conversation protocols: a formalism for specification and verification of reactive electronic services. Theor. Comput. Sci. 328(1–2), 19–37 (2004). https://doi.org/10.1016/j.tcs.2004.07.004

    Article  Google Scholar 

  17. Guanciale, R., Tuosto, E.: An abstract semantics of the global view of choreographies. In: Bartoletti, M., Henrio, L., Knight, S., Vieira, H.T. (eds.) Proceedings 9th Interaction and Concurrency Experience, ICE 2016, Heraklion, Greece, 8–9 June 2016. EPTCS, vol. 223, pp. 67–82 (2016). https://doi.org/10.4204/EPTCS.223.5

  18. Guanciale, R., Tuosto, E.: Realisability of pomsets. J. Log. Algebraic Methods Program. 108, 69–89 (2019). https://doi.org/10.1016/j.jlamp.2019.06.003

    Article  Google Scholar 

  19. Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM 32(1), 137–161 (1985). https://doi.org/10.1145/2455.2460

    Article  Google Scholar 

  20. Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, 7–12 January 2008. pp. 273–284. ACM (2008). https://doi.org/10.1145/1328438.1328472

  21. ITU-TS: ITU-TS Recommendation Z.120: Message Sequence Chart 2011 (MSC11). Tech. rep., ITU-TS, Geneva (2011)

    Google Scholar 

  22. Jongmans, S.-S., Yoshida, N.: Exploring type-level bisimilarity towards more expressive multiparty session types. In: ESOP 2020. LNCS, vol. 12075, pp. 251–279. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-44914-8_10

    Chapter  Google Scholar 

  23. Kappé, T., Brunet, P., Luttik, B., Silva, A., Zanasi, F.: On series-parallel pomset languages: rationality, context-freeness and automata. J. Log. Algebraic Methods Program. 103, 130–153 (2019). https://doi.org/10.1016/j.jlamp.2018.12.001

    Article  Google Scholar 

  24. Katoen, J., Lambert, L.: Pomsets for MSC. In: König, H., Langendörfer, P. (eds.) Formale Beschreibungstechniken für verteilte Systeme, 8. GI/ITG-Fachgespräch, Cottbus, 4. und 5. Juni 1998. pp. 197–207. Verlag Shaker (1998)

    Google Scholar 

  25. Lohmann, N., Wolf, K.: Realizability is controllability. In: Laneve, C., Su, J. (eds.) WS-FM 2009. LNCS, vol. 6194, pp. 110–127. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-14458-5_7

    Chapter  Google Scholar 

  26. Milner, R. (ed.): A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980). https://doi.org/10.1007/3-540-10235-3

    Book  Google Scholar 

  27. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, part I. Theor. Comput. Sci. 13, 85–108 (1981). https://doi.org/10.1016/0304-3975(81)90112-2

    Article  Google Scholar 

  28. Pratt, V.R.: Modeling concurrency with partial orders. Int. J. Parallel Program. 15(1), 33–71 (1986). https://doi.org/10.1007/BF01379149

    Article  Google Scholar 

  29. Sangiorgi, D.: Introduction to bisimulation and coinduction. Cambridge University Press (2011). https://doi.org/10.1017/CBO9780511777110

  30. Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press (2001)

    Google Scholar 

  31. Scalas, A., Yoshida, N.: Less is more: multiparty session types revisited. Proc. ACM Program. Lang. 3(POPL), 1–29 (2019). https://doi.org/10.1145/3290343

  32. Schewe, K.-D., Aït-Ameur, Y., Benyagoub, S.: Realisability of choreographies. In: Herzig, A., Kontinen, J. (eds.) FoIKS 2020. LNCS, vol. 12012, pp. 263–280. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-39951-1_16

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Open University, Heerlen, Netherlands

    Luc Edixhoven & Sung-Shik Jongmans

  2. Centrum Wiskunde & Informatica (CWI), Amsterdam, Netherlands

    Luc Edixhoven & Sung-Shik Jongmans

Authors
  1. Luc Edixhoven
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sung-Shik Jongmans
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Luc Edixhoven .

Editor information

Editors and Affiliations

  1. University of Oslo, Oslo, Norway

    Silvia Lizeth Tapia Tarifa

  2. CISTER Research Centre, ISEP, Porto, Portugal

    José Proença

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Edixhoven, L., Jongmans, SS. (2022). Realisability of Branching Pomsets. In: Tapia Tarifa, S.L., Proença, J. (eds) Formal Aspects of Component Software. FACS 2022. Lecture Notes in Computer Science, vol 13712. Springer, Cham. https://doi.org/10.1007/978-3-031-20872-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20872-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20871-3

  • Online ISBN: 978-3-031-20872-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation