Abstract
The link-calculus is a model for concurrency that extends the point-to-point communication discipline of Milner’s CCS with multiparty interactions. Links are used to build chains describing how information flows among the different agents participating in a multiparty interaction. The inherent non-determinism in deciding both, the number of participants in an interaction and how they synchronize, makes it difficult to devise efficient verification techniques for this language. In this paper we propose a symbolic semantics and a symbolic bisimulation for the link-calculus which are more amenable to automating reasoning. Unlike the operational semantics of the link-calculus, the symbolic semantics is finitely branching and it represents, compactly, a possibly infinite number of transitions. We give necessary and sufficient conditions to efficiently check the validity of symbolic configurations. We also implement an interpreter based on this semantics and we show how to use such implementation for verification.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bodei, C., Brodo, L., Bruni, R.: Open multiparty interaction. In: Martí-Oliet, N., Palomino, M. (eds.) WADT 2012. LNCS, vol. 7841, pp. 1–23. Springer, Heidelberg (2013). doi:10.1007/978-3-642-37635-1_1
Bodei, C., Brodo, L., Bruni, R., Chiarugi, D.: A flat process calculus for nested membrane interactions. Sci. Ann. Comp. Sci. 24(1), 91–136 (2014)
Calder, M., Shankland, C.: A symbolic semantics and bisimulation for full LOTOS. In: Kim, M., Chin, B., Kang, S., Lee, D. (eds.) IFIP Conference Proceedings, FORTE, vol. 197, pp. 185–200. Kluwer (2001)
Gorrieri, R., Versari, C.: Introduction to Concurrency Theory - Transition Systems and CCS. Texts in Theoretical Computer Science. An EATCS Series. Springer, Cham (2015)
Hennessy, M., Lin, H.: Symbolic bisimulations. Theor. Comput. Sci. 138(2), 353–389 (1995)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, New York (1996)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall Inc, Upper Saddle River (1985)
Lehmann, D.J., Rabin, M.O.: On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem. In: White, J., Lipton, R.J., Goldberg, P.C. (eds.) POPL, pp. 133–138. ACM Press (1981)
Milner, R.: A Calculus of Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)
Montanari, U., Sammartino, M.: Network conscious pi-calculus: a concurrent semantics. In: Proceedings of Mathematical Foundations of Programming Semantics (MFPS), Electronic Notes in Theoretical Computer Science, vol. 286, pp. 291–306. Elsevier (2012)
Nestmann, U.: On the expressive power of joint input. Electron. Notes Theor. Comput. Sci. 16(2), 145–152 (1998)
Verdejo, A.: Building tools for LOTOS symbolic semantics in maude. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 292–307. Springer, Heidelberg (2002). doi:10.1007/3-540-36135-9_19
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Brodo, L., Olarte, C. (2017). Symbolic Semantics for Multiparty Interactions in the Link-Calculus. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds) SOFSEM 2017: Theory and Practice of Computer Science. SOFSEM 2017. Lecture Notes in Computer Science(), vol 10139. Springer, Cham. https://doi.org/10.1007/978-3-319-51963-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-51963-0_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-51962-3
Online ISBN: 978-3-319-51963-0
eBook Packages: Computer ScienceComputer Science (R0)