Skip to main content
SpringerLink
Log in

Timed testing of concurrent systems

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1993)

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

Included in the following conference series:

Abstract

We are concerned with timing considerations for concurrent systems where the time needed by the individual actions is not known beforehand; it has long been suspected that partial order semantics is useful here. We develop a suitable testing scenario to study this idea. With some view of timed behaviour, we can confirm that interval semiword semantics, a special partial order semantics, is indeed useful. With another view, our testing scenario leads to timed-refusal-trace semantics, where no relation to partial order semantics is obvious.

This work was partially supported by the ESPRIT Basic Research Working Group 6067 CALIBAN (CAusal calculI BAsed on Nets) and the Fakultät für Informatik, TU München.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Best. Weighted basic Petri nets. In F.H. Vogt, editor, Concurrency 88, Lect. Notes Comp. Sci. 335, 257–276. Springer, 1988.

    Google Scholar 

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

    Google Scholar 

  3. R.J. v. Glabbeek. The refinement theorem for ST-bisimulation semantics. In M. Broy and C.B. Jones, editors, Proc. IFIP Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, 1990. To appear.

    Google Scholar 

  4. M. Hennessy. Concurrent testing of processes. Technical Report 11/91, Dept. Comp. Sci. Univ. of Sussex, Brighton, 1991.

    Google Scholar 

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

    Google Scholar 

  6. I. Phillips. Refusal testing. Theoret. Comput. Sci., 50:241–284, 1987.

    Google Scholar 

  7. G.M. Reed and A.W. Roscoe. Metric spaces as models for real-time concurrency. In Third Workshop on the Mathematical Foundations of Programming Language Semantics, Lect. Notes Comp. Sci. 298, 331–343. Springer, 1987.

    Google Scholar 

  8. G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. Theoret. Comput. Sci., 58:249–261, 1988.

    Google Scholar 

  9. P.H. Starke. Some properties of timed nets under the earliest firing rule. In G. Rozenberg, editor, Advances in Petri Nets 1989, Lect. Notes Comp. Sci. 424, 418–432. Springer, 1990.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, Universität Augsburg, Universitätsstr. 8, D-8900, Augsburg

    Walter Vogler

Authors
  1. Walter Vogler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Lingas Rolf Karlsson Svante Carlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vogler, W. (1993). Timed testing of concurrent systems. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-56939-1_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56939-8

  • Online ISBN: 978-3-540-47826-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation