Fast asynchronous systems in dense time

  • Lars Jenner
  • Walter Vogler
Session 1: Process Theory I
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1099)


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.

Unable to display preview. Download preview PDF.


  1. [AD94]
    R. Alur and D. Dill. A theory of timed automata. Theoret. Comput. Sci., 126:183–235, 1994.CrossRefGoogle Scholar
  2. [AKH92]
    S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Information, 29:737–760, 1992.CrossRefGoogle Scholar
  3. [CGR95]
    F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. unpublished manuscript, 1995.Google Scholar
  4. [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
  5. [DNH84]
    R. De Nicola and M. C. B. Hennessy. Testing equivalence for processes. Theoret. Comput. Sci., 34:83–133, 1984.CrossRefGoogle Scholar
  6. [HR90]
    M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2/90, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1990.Google Scholar
  7. [LF81]
    N. Lynch and M. Fischer. On describing the behaviour and implementation of distributed systems. Theoret. Comput. Sci., 13:17–43, 1981.CrossRefGoogle Scholar
  8. [LV95]
    N. Lynch and F. Vaandrager. Forward and backward simulations I: Untimed systems. Information and Computation, 121:214–233, 1995.CrossRefGoogle Scholar
  9. [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
  10. [Phi87]
    I. Phillips. Refusal testing. Theoret. Comput. Sci., 50:241–284, 1987.CrossRefGoogle Scholar
  11. [Vog95a]
    W. Vogler. Timed testing of concurrent systems. Information and Computation, 121:149–171, 1995.Google Scholar
  12. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Lars Jenner
    • 1
  • Walter Vogler
    • 1
  1. 1.Inst. f. MathematikUniv. AugsburgAugsburgGermany

Personalised recommendations