Performance preorder: ordering processes with respect to speed
DOI10.1007/3-540-60246-1_150zbMATH Open1193.68173OpenAlexW1495199168MaRDI QIDQ3569033FDOQ3569033
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
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (7)
- Title not available (Why is that?)
- On performance congruences for process algebras
- On efficiency preorders
- On the coarsest congruence within global-clock-bounded equivalence
- An efficiency preorder for processes
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
- Time Unbalanced Partial Order
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)
