Symbolic Semantics for Multiparty Interactions in the Link-Calculus
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.
KeywordsOperational Semantic Label Transition System Virtual Link Link Chain Virtual Action
- 3.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)Google Scholar
- 8.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)Google Scholar
- 10.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)Google Scholar