Skip to main content
SpringerLink
Log in

Concurrent testing of processes

  • Conference paper
  • First Online:
CONCUR '92 (CONCUR 1992)

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

Included in the following conference series:

Abstract

We develop a noninterleaving semantic theory of processes based on testing. We assume that all actions have a non-zero duration and the allowed tests take advantage of this assumption. The result is a semantic theory in which concurrency is differentiated from nondeterminism.

We show that the semantic preorder based on these tests is preserved by so-called “stable” action refinement and may be characterised as the largest such preorder contained in the standard testing preorder.

This work has been supported by SERC and the ESPRIT/BRA CEDISYS project

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. L. Aceto. Full abstraction for series-parallel-pomsets. In Proceedings of CAAP, volume 493 of Lecture Notes in Computer Science, pages 1–25. Springer-Verlag, 1991.

    Google Scholar 

  2. L. Aceto and U. Engberg. Failure semantics for a simple process language with refinement. Technical report, INRIA, Sophia-Antipolis, 1991.

    Google Scholar 

  3. L. Aceto and M. Hennessy. Adding action refinement to a finite process algebra. In Proceedings of 18 th ICALP, Lecture Notes in Computer Science. Springer-Verlag, 1991.

    Google Scholar 

  4. L. Aceto and M. Hennessy. Towards action refinement in process algebras. Information and Computation, 1991. to appear.

    Google Scholar 

  5. L. Aceto and M. Hennessy. Termination, deadlock and divergence in process algebras. Journal of the ACM, 39(1):147–187, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Boudol and I. Castellani. Permutation of transitions: an event structure semantics for CCS and SCCS. In Proceedings of Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, number 354 in Lecture Notes in Computer Science, pages 411–427, 1989.

    Google Scholar 

  7. Ph. Darondeau and P. Degano. About semantic action refinement. Technical Report 11/89, Dipartimento di Informatica, Università di Pisa, 1989. To appear in Fundamenta Informaticae.

    Google Scholar 

  8. P. Degano and P. Darondeau. Causal trees. In Proceedings of ICALP 89, number 372 in Lecture Notes in Computer Science, pages 234–248. Springer-Verlag, 1989.

    Google Scholar 

  9. P. Darondeau and P. Degano. Event structures, causal trees and refinements, 1990. Submitted to Theoretical Computer Science.

    Google Scholar 

  10. R. DeNicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 24:83–113, 1984.

    Article  MathSciNet  Google Scholar 

  11. P. Degano, R. De Nicola, and U. Montanari. A partial ordering semantics for CCS. Theoretical Computer Science, 75:223–262, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  12. M. Hennessy. An Algebraic Theory of Processes. MIT Press, 1988.

    Google Scholar 

  13. L. Jategaonkar. Personal communication. 1992.

    Google Scholar 

  14. L. Jategoankar and A. Meyer. Testing equivalence for petri nets with action refinement. Technical report, MIT, 1992.

    Google Scholar 

  15. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  16. D. Murphy and D. Pitt. Testing, betting and true concurrency. In Proceedings of Concur 91, number 527 in Lecture Notes in Computer Science, 1991.

    Google Scholar 

  17. D. Taubner and W. Vogler. The step failures semantics. In F.J. Brandenburg et. al., editor, Proceedings of STACS 87, number 247 in Lecture Notes in Computer Science, pages 348–359. Springer-Verlag, 1987.

    Google Scholar 

  18. R.J. van Glabbeek. The refinement theorem for ST-bisimulation. In Prooceedings IFIP Working Group, Sea of Galilee, Lecture Notes in Computer Science. Springer-Verlag, 1990.

    Google Scholar 

  19. R.J. van Glabbeek and F.W. Vaandrager. Petri net models for algebraic theories of concurrency. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Prooceedings PARLE conference, number 259 in Lecture Notes in Computer Science, pages 224–242. Springer-Verlag, 1987.

    Google Scholar 

  20. W. Vogler. Bisimulation and action refinement. Technical report, Technische Universität München, 1990.

    Google Scholar 

  21. W. Vogler. Failure semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4:139–162, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  22. W. Vogler. Is partial order semantics necessary for action refinement ? Technical report, Technische Universität München, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Sussex, England

    M. Hennessy

Authors
  1. M. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W.R. Cleaveland

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hennessy, M. (1992). Concurrent testing of processes. In: Cleaveland, W. (eds) CONCUR '92. CONCUR 1992. Lecture Notes in Computer Science, vol 630. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0084785

Download citation

  • DOI: https://doi.org/10.1007/BFb0084785

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55822-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation