Extensional equivalence for transition systems
Acta Informatica
An efficiency preorder for processes
Acta Informatica
MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
A process algebra for timed systems
Information and Computation
Timed testing of concurrent systems
Information and Computation
Forward and backward simulations I.: untimed systems
Information and Computation
Fast asynchronous systems in dense time
Theoretical Computer Science
Distributed Algorithms
Modular Construction and Partial Order Semantics of Petri Nets
Modular Construction and Partial Order Semantics of Petri Nets
Metric Spaces as Models for Real-Time Concurrency
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
CONCUR '95 Proceedings of the 6th 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
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Bisimulation on speed: worst-case efficiency
Information and Computation
Measuring the performance of asynchronous systems with PAFAS
Theoretical Computer Science - Process algebra
Bisimulation on speed: a unified approach
Theoretical Computer Science
Bisimulation on speed: a unified approach
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case efficiency of asynchronous systems. The resulting testing-preorder is characterized with a variant of refusal traces and shown to satisfy some properties that make it attractive as a faster-than relation. Finally, one implementation of a bounded buffer is shown to be strictly faster than two others - in contrast to a result obtained with a different approach by Arun-Kumar and Hennessy.