Verification Techniques for a Network Algebra

DOI10.3233/FI-2020-1890zbMATH Open1464.68233OpenAlexW3005962139MaRDI QIDQ5131777

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

verificationprocess calculiconcurrency theoryCCSsymbolic semantics

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)

Related Items (5)

Efficient algorithms for checking the equivalence of multistage interconnection networks ⋮ Towards Certifying Network Calculus ⋮ The \texttt{link}-calculus for open multiparty interactions ⋮ A constraint-based language for multiparty interactions ⋮ Title not available (Why is that?)

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)