Comparing the Efficiency of Asynchronous Systems

  • Lars Jenner
  • Walter Vogler
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1601)


A timed process algebra is developed for evaluating the temporal worst-case efficiency of asynchronous concurrent systems. For the sake of simplicity, we use a classical CCS-like algebra where actions may occur arbitrarily within a continuous time interval, yielding arbitrary relative speeds of the components. Via the timed testing approach, asynchronous systems are then related w.r.t. their worst-case efficiency, yielding an efficiency preorder. We show that this preorder can just as well be based on much simpler discrete time and that it can be characterized with some kind of refusal traces. Finally, precongruence results are provided for all operators of the algebra, where prefix, choice and recursion require special attention.


Operational Semantic Initial Process Parallel Composition Residual Time Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AKH92]
    S. Arun-Kumar and M. Hennessy. An Efficiency Preorder for Processes. Acta Informatica, 29:737–760, 1992.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [AKN95]
    S. Arun-Kumar and V. Natarajan. Conformance: a Precongruence close to Bisimilarity. In J. Desel, editor, Structures in Concurrency Theory, Worksh. in Computing, 55–68. Springer, 1995.Google Scholar
  3. [BD91]
    E. Badouel and P. Darondeau. On Guarded Recursion. TCS, 81:403–408, 1991.MathSciNetCrossRefzbMATHGoogle Scholar
  4. [Bih98]
    E. Bihler. Effizienzvergleich bei verteilten Systemen (German). Master’s thesis, Institut für Informatik, Universität Augsburg, 1998.Google Scholar
  5. [Bur92]
    Jerry R. Burch. Trace Algebra for Automatic Verification of Real-Time Concurrent Systems. PhD thesis, School of CS, Carnegie Mellon Univ., 1992.Google Scholar
  6. [CGR97]
    F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. Acta Informatica, 34 no. 11:805–835, 1997.MathSciNetCrossRefzbMATHGoogle Scholar
  7. [Cor98]
    F. Corradini. On the Coarsest Congruence within Global-Clock-Bounded equivalence. TCS, 19:225–237, 1998.MathSciNetCrossRefzbMATHGoogle Scholar
  8. [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
  9. [DNH84]
    R. De Nicola and M.C.B. Hennessy. Testing equivalence for processes. TCS, 34:83–133, 1984.MathSciNetCrossRefzbMATHGoogle Scholar
  10. [Hen88]
    M. Hennessy. An algebraic theory of processes. the M.I.T. Press, 1988.Google Scholar
  11. [HR95]
    M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117:221–239, 1995.MathSciNetCrossRefzbMATHGoogle Scholar
  12. [Jen96]
    L. Jenner. Modular construction of fast asynchronous systems. Technical Report 1996-2, Inst. f. Informatik, Univ. Augsburg, 1996.Google Scholar
  13. [Jen98]
    L. Jenner. Further studies on timed testing of concurrent systems. Technical Report 1998-4, Inst. f. Informatik, Univ. Augsburg, 1998.Google Scholar
  14. [JV95]
    L. Jenner and W. Vogler. Fast asynchronous systems in dense time. Technical Report Nr. 344, Inst. f. Mathematik, Univ. Augsburg, 1995. Extended abstract appeared in Proc. ICALP 96.Google Scholar
  15. [Lyn96]
    N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, 1996.zbMATHGoogle Scholar
  16. [MF76]
    P. Merlin and D. Farber. Recoverability of communication protocols — implications of a theoretical study. IEEE Trans. Comm., 24:1036–1043, 1976.MathSciNetCrossRefzbMATHGoogle Scholar
  17. [Mil89]
    R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  18. [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
  19. [NC96a]
    V. Natarajan and R. Cleaveland. An algebraic theory of process efficiency. In Proc. LICS’96. 11th Annual IEEE Symposium, 1996.Google Scholar
  20. [NC96b]
    V. Natarajan and R. Cleaveland. Predictability of real-time systems: A process-algebraic approach. In Proc. RTSS’96. 17th IEEE Real-Time Systems Symposium, 1996.Google Scholar
  21. [Pop91]
    L. Popova. On time Petri nets. J. Inform. Process. Cybern. EIK, 27:227–244, 1991.zbMATHGoogle Scholar
  22. [Pri98]
    In Corrado Priami, editor, Proceedings PAPM’98, sixth international work-shop on Process Algebras and Performance Modelling, Nice, France, pages 137–151. Universita degli studi di Verona, Facolta di Scienze, Istituto Policattedra, September 1998.Google Scholar
  23. [Sch95]
    S. Schneider. An operational semantics for timed CSP. Information and Computation, 116(2), pp.193–213, 1995.MathSciNetCrossRefzbMATHGoogle Scholar
  24. [Vog95]
    W. Vogler. Timed testing of concurrent systems. Information and Computation, 121:149–171, 1995.MathSciNetCrossRefzbMATHGoogle Scholar
  25. [Zic94]
    J. Zic. Time constrained buffer specifications in CSP+T and timed CSP. ACM TOPLAS, 16–6:1661–1674, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Lars Jenner
    • 1
  • Walter Vogler
    • 1
  1. 1.Institut für InformatikUniversität AugsburgAugsburgGermany

Personalised recommendations