An efficiency preorder for processes
Acta Informatica
A process algebra for timed systems
Information and Computation
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Timing and causality in process algebra
Acta Informatica
Fast asynchronous systems in dense time
Theoretical Computer Science
Communication and Concurrency
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science
A Temporal Calculus of Communicating Systems
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
An Algebraic Theory of Process Efficiency
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
PAFAS at Work: Comparing the Worst-Case Efficiency of Three Buffer Implementations
APAQS '01 Proceedings of the Second Asia-Pacific Conference on Quality Software
Information and Computation
Bisimulation on speed: worst-case efficiency
Information and Computation
(Bi)simulations up-to characterise process semantics
Information and Computation
Counting the Cost in the Picalculus (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Two process–algebraic approaches have been developed for comparing two bisimulation–equivalent processes with respect to speed: the one of Moller/Tofts equips actions with lower time bounds, while the one by Lüttgen/Vogler considers upper time bounds instead. This paper sheds new light on both approaches by testifying to their close relationship. We introduce a general, intuitive concept of “faster–than”, which is formalised by a notion of amortised faster–than preorder. When closing this preorder under all contexts, exactly the two faster–than preorders investigated by Moller/Tofts and Lüttgen/Vogler arise. For processes incorporating both lower and upper time bounds we also show that the largest precongruence contained in the amortised faster–than preorder is not a proper preorder but a timed bisimulation. In the light of this result we systematically investigate under which circumstances the amortised faster–than preorder degrades to an equivalence.