On the coarsest congruence within global-clock-bounded equivalence

DOI10.1016/S0304-3975(97)00237-5MaRDI QIDQ1129264zbMATH OpenFDO

Authors Flavio Corradini

Publication date 13 August 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(97)00237-5

zbMATH Keywords

performance evaluationtimed bisimulationstimed process algebras

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• On performance congruences for process algebras
• CONCUR 2005 – Concurrency Theory
• Distributed bisimulations

Cites work

• A theory of processes with durational actions
• Dynamic matrices and the cost analysis of concurrent programs
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• Performance preorder: ordering processes with respect to speed
• Timing and causality in process algebra

Cited in

(1)

• On performance congruences for process algebras

This page was built for publication: On the coarsest congruence within global-clock-bounded equivalence

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