Verification techniques for a network algebra

DOI10.3233/FI-2020-1890MaRDI QIDQ5131777zbMATH OpenOpenAlexFDO

Authors Linda Brodo, Carlos Olarte

Publication date 9 November 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1890

zbMATH Keywords

CCSconcurrency theoryprocess calculisymbolic semanticsverification

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A formal approach to open multiparty interactions
• Symbolic Semantics for Multiparty Interactions in the Link-Calculus
• scientific article; zbMATH DE number 1482700
• An algebraic verification of a mobile network
• scientific article; zbMATH DE number 1101604

Cited in

(7)

• A formal approach to open multiparty interactions
• Efficient algorithms for checking the equivalence of multistage interconnection networks
• The \texttt{link}-calculus for open multiparty interactions
• A constraint-based language for multiparty interactions
• scientific article; zbMATH DE number 828718 (Why is no real title available?)
• scientific article; zbMATH DE number 919112 (Why is no real title available?)
• Towards Certifying Network Calculus

This page was built for publication: Verification techniques for a network algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131777)