Fast asynchronous systems in dense time
A testing scenario in the sense of De Nicola and Hennessy is developed to measure the worst-case efficiency of asynchronous systems using dense time. For all three variants considered, it is shown that one can equivalently use discrete time; in the discrete versions, one variant coincides with an approach based on discrete time in [Vog95b], and thus we can clarify the assumptions behind this approach. The resulting testing-preorders are characterized with some kind of refusal traces and shown to satisfy some properties that make them attractive as faster-than relations. The three testing-preorders are incomparable in general, but for some interesting classes of systems implications are shown.
Unable to display preview. Download preview PDF.
- [CGR95]F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. unpublished manuscript, 1995.Google Scholar
- [CZ91]R. Cleaveland and A. Zwarico. A theory of testing for real-time. In Proc. 6th Symp. on Logic in Computer Science, pages 110–119. IEEE Computer Society Press, 1991.Google Scholar
- [HR90]M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2/90, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1990.Google Scholar
- [MT91]F. Moller and C. Tofts. Relating processes with respect to speed. In J. Baeten and J. Groote, editors, CONCUR '91, Lect. Notes Comp. Sci. 527, 424–438. Springer, 1991.Google Scholar
- [Vog95a]W. Vogler. Timed testing of concurrent systems. Information and Computation, 121:149–171, 1995.Google Scholar
- [Vog95b]W. Vogler. Faster asynchronous systems. In I. Lee and S. Smolka, editors, CONCUR 95, Lect. Notes Comp. Sci. 962, 299–312. Springer, 1995.Google Scholar