Performance preorder: ordering processes with respect to speed

DOI10.1007/3-540-60246-1_150MaRDI QIDQ3569033zbMATH OpenOpenAlexFDO

Authors Roberto Gorrieri, Marco Roccetti, Flavio Corradini

Publication date 17 June 2010

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

Full work available at URL https://doi.org/10.1007/3-540-60246-1_150

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Performance preorder and competitive equivalence
• An efficiency preorder for processes
• An efficiency preorder for processes
• scientific article; zbMATH DE number 1863169
• On efficiency preorders

Cited in

(10)

• On the coarsest congruence within global-clock-bounded equivalence
• On performance congruences for process algebras
• An efficiency preorder for processes
• Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
• On efficiency preorders
• Time Unbalanced Partial Order
• scientific article; zbMATH DE number 1231595 (Why is no real title available?)
• An efficiency preorder for processes
• Performance preorder and competitive equivalence
• A faster-than relation for semi-Markov decision processes

This page was built for publication: Performance preorder: ordering processes with respect to speed

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