Skip to main content
SpringerLink
Log in

Comparing the Efficiency of Asynchronous Systems

  • Conference paper
  • First Online:
Book cover Formal Methods for Real-Time and Probabilistic Systems (ARTS 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1601))

Abstract

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.

A preliminary version of this paper appeared in the proceedings of PAPM’98 [Pri98]

This work was supported by the DFG-project ‘Halbordnungstesten’

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Arun-Kumar and M. Hennessy. An Efficiency Preorder for Processes. Acta Informatica, 29:737–760, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  2. 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. E. Badouel and P. Darondeau. On Guarded Recursion. TCS, 81:403–408, 1991.

    Article  MathSciNet  MATH  Google Scholar 

  4. E. Bihler. Effizienzvergleich bei verteilten Systemen (German). Master’s thesis, Institut für Informatik, Universität Augsburg, 1998.

    Google Scholar 

  5. 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. F. Corradini, R. Gorrieri, and M. Roccetti. Performance preorder and competitive equivalence. Acta Informatica, 34 no. 11:805–835, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  7. F. Corradini. On the Coarsest Congruence within Global-Clock-Bounded equivalence. TCS, 19:225–237, 1998.

    Article  MathSciNet  MATH  Google Scholar 

  8. 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. R. De Nicola and M.C.B. Hennessy. Testing equivalence for processes. TCS, 34:83–133, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Hennessy. An algebraic theory of processes. the M.I.T. Press, 1988.

    Google Scholar 

  11. M. Hennessy and T. Regan. A process algebra for timed systems. Information and Computation, 117:221–239, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  12. L. Jenner. Modular construction of fast asynchronous systems. Technical Report 1996-2, Inst. f. Informatik, Univ. Augsburg, 1996.

    Google Scholar 

  13. L. Jenner. Further studies on timed testing of concurrent systems. Technical Report 1998-4, Inst. f. Informatik, Univ. Augsburg, 1998.

    Google Scholar 

  14. 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. N. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, San Francisco, 1996.

    MATH  Google Scholar 

  16. P. Merlin and D. Farber. Recoverability of communication protocols — implications of a theoretical study. IEEE Trans. Comm., 24:1036–1043, 1976.

    Article  MathSciNet  MATH  Google Scholar 

  17. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  18. 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. V. Natarajan and R. Cleaveland. An algebraic theory of process efficiency. In Proc. LICS’96. 11th Annual IEEE Symposium, 1996.

    Google Scholar 

  20. 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. L. Popova. On time Petri nets. J. Inform. Process. Cybern. EIK, 27:227–244, 1991.

    MATH  Google Scholar 

  22. 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. S. Schneider. An operational semantics for timed CSP. Information and Computation, 116(2), pp.193–213, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  24. W. Vogler. Timed testing of concurrent systems. Information and Computation, 121:149–171, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  25. J. Zic. Time constrained buffer specifications in CSP+T and timed CSP. ACM TOPLAS, 16–6:1661–1674, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Augsburg, D-86135, Augsburg, Germany

    Lars Jenner & Walter Vogler

Authors
  1. Lars Jenner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lehrstuhl für Informatik, University of Erlangen-Nürnberg, Martensstr. 3, D-91058, Erlangen, Germany

    Joost-Pieter Katoen

  2. Formal Methods and Tools Group, University of Twente, P.O. Box 217, 7500 AE, Enschede, The Netherlands

    Joost-Pieter Katoen

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jenner, L., Vogler, W. (1999). Comparing the Efficiency of Asynchronous Systems. In: Katoen, JP. (eds) Formal Methods for Real-Time and Probabilistic Systems. ARTS 1999. Lecture Notes in Computer Science, vol 1601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48778-6_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48778-6_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66010-1

  • Online ISBN: 978-3-540-48778-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation