Symbolic Semantics for Multiparty Interactions in the Link-Calculus
From MaRDI portal
Publication:2971125
DOI10.1007/978-3-319-51963-0_6zbMATH Open1433.68241OpenAlexW2569614957MaRDI QIDQ2971125FDOQ2971125
Publication date: 4 April 2017
Published in: SOFSEM 2017: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-51963-0_6
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A Compositional Approach to Performance Modelling
- A calculus of communicating systems
- Symbolic bisimulations
- Network Conscious Ο-calculus: A Concurrent Semantics
- Introduction to concurrency theory. Transition systems and CCS
- Open Multiparty Interaction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
Recommendations
- Title not available (Why is that?) π π
- Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types π π
- Symbolic protocol analysis for monoidal equational theories π π
- A fully abstract denotational semantics for the calculus of higher-order communicating systems π π
- A Denotational Semantic Theory of Concurrent Systems π π
- Sequent Calculi for Multi-modal Logic with Interaction π π
- A formal approach to open multiparty interactions π π
- The \texttt{link}-calculus for open multiparty interactions π π
- A constraint-based language for multiparty interactions π π
- A denotational semantics for the symmetric interaction combinators π π
This page was built for publication: Symbolic Semantics for Multiparty Interactions in the Link-Calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971125)
