Skip to main content

Faster asynchronous systems

  • Session: Testing Semantics
  • Conference paper
  • First Online:
CONCUR '95: Concurrency Theory (CONCUR 1995)

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

Included in the following conference series:

Abstract

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.

This work was partially supported by the DFG and the ESPRIT Basic Research Working Group 6067 CALIBAN (CAusal calcuLI BAsed on Nets).

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

Access this chapter

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  Google Scholar 

  2. 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 

  3. R. De Nicola and M.C.B. Hennessy. Testing equivalence for processes. Theoret. Comput. Sci., 34:83–133, 1984.

    Article  Google Scholar 

  4. M. Hennessy and T. Regan. A temporal process algebra. Technical Report 2/90, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1990.

    Google Scholar 

  5. N. Lynch and M. Fischer. On describing the behaviour and implementation of distributed systems. Theoret. Comput. Sci., 13:17–43, 1981.

    Article  Google Scholar 

  6. N. Lynch and F. Vaandrager. Forward and backward simulations — part i: Untimed systems. Technical Report Report CS-R9313, CWI, Amsterdam, 1993.

    Google Scholar 

  7. 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 

  8. W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets. Lect. Notes Comp. Sci. 625. Springer, 1992.

    Google Scholar 

  9. W. Vogler. Timed testing of concurrent systems. In A. Lingas, R. Karlsson, and S. Carlsson, editors, ICALP 93, Lect. Notes Comp. Sci. 700, 532–543. Springer, 1993. full version to appear in Information and Computation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Insup Lee Scott A. Smolka

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1995). Faster asynchronous systems. In: Lee, I., Smolka, S.A. (eds) CONCUR '95: Concurrency Theory. CONCUR 1995. Lecture Notes in Computer Science, vol 962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60218-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-60218-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60218-7

  • Online ISBN: 978-3-540-44738-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics