On performance congruences for process algebras

DOI10.1006/inco.1998.2726zbMath0921.68031OpenAlexW2069267042MaRDI QIDQ1275822

Flavio Corradini

Publication date: 13 January 1999

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2726

zbMATH Keywords

performance equivalencebusy waitingperformance congruence

Mathematics Subject Classification ID

Related Items (6)

Undecidability of performance equivalence of Petri nets ⋮ The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes ⋮ On testing urgency through laziness over processes with durational actions ⋮ Decidability of performance equivalence for basic parallel processes ⋮ On the semantics of durational actions ⋮ Absolute versus relative time in process algebras.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of processes with durational actions
• Symbolic bisimulations
• Performance preorder and competitive equivalence
• A timed model for communicating sequential processes
• An efficiency preorder for processes
• A theory of processes with localities
• Testing equivalences for processes
• A process algebra for timed systems
• Timed testing of concurrent systems
• Timing and causality in process algebra
• Real time process algebra
• Performance preorder: Ordering processes with respect to speed
• Three Partition Refinement Algorithms
• Dynamic matrices and the cost analysis of concurrent programs
• A parametric approach to localities
• Barbed bisimulation

This page was built for publication: On performance congruences for process algebras