Process algebra versus axiomatic specification of a real-time protocol

DOI10.1007/3-540-45499-3_7MaRDI QIDQ2767163zbMATH OpenFDO

Authors Antonio Cerone

Publication date 28 January 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45499-3_7

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Factorizing proofs in timed CSP
• Real time process algebra
• Process algebras for network communication
• Formal Methods for the Design of Real-Time Systems
• scientific article; zbMATH DE number 497653

Cited in

(3)

• A compared study of two correctness proofs for the standardized algorithm of ABR conformance
• A specification theory of real-time processes
• A real-time process algebra with open intervals and maximal progress

This page was built for publication: Process algebra versus axiomatic specification of a real-time protocol

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