Skip to main content
SpringerLink
Log in

Concurrent testing of processes

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

Using a form of “ST-operational semantics” we develop a noninterleaving semantic theory of processes based on testing. This operational semantics is based on the assumption that all actions have a non-zero duration and the allowed tests can therefore distinguish between the beginning and the termination of actions. 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 refinements and may be characterised as the largest such preorder contained in the standard testing preorder.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aceto, L.: Full abstraction for series-parallel-pomsets. In: Proc. CAAP, volume 493 of (Lect. Notes in Comput. Sci., vol. 493, pp. 1–25. Berlin: Springer 1991

    Google Scholar 

  2. Aceto, L., Engberg, U.: Failures semantics for a simple process language with refinement. In: Biswas, S., Nori, K.V. (eds.) FST and TCS 11, Foundations of Software Technology and Theoretical Computer Science, New Delhi, India (Lect. Notes in Comput. Sci., 89-vol. 560, pp. 89–108) Berlin: Springer 1991

    Google Scholar 

  3. Aceto, L., Hennessy, M., Adding action refinement to a finite process algebra. Inf. Comput.115(2), 179–247 (1994)

    Google Scholar 

  4. [] Aceto, L., Hennessy, M.: Termination deadlock and divergence in process algebras. J. ACM39(1), 147–187 (1992)

    Google Scholar 

  5. Aceto, L., Hennessy, M.: Towards action refinement in process algebras. Inf. Comput.103, 204–266 (1993)

    Google Scholar 

  6. Boudol, G., Castellani, I.: Permutation of transitions: an event structure semantics for CCS and SCCS. In: Proc. of Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, (Lect. Notes in Comput. Sci., vol. 354, pp. 411–427) Berlin: Springer 1989

    Google Scholar 

  7. Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing localities. Theoret. Comput. Sci.,114, 31–61 (1993)

    Google Scholar 

  8. Degano, P., Darondeau, P.: Causal trees. In: Proc. ICALP 89, (Lect. Notes in Comput. Sci., vol. 372: pp. 234–248) Berlin: Springer 1989

    Google Scholar 

  9. Darondeau, Ph., Degano, P.: About semantic action refinement. Fund. Inf.XIV, 221–234 (1991)

    Google Scholar 

  10. Darondeau, P., Degano, P.: Refinement of actions in event structures and causal trees. Theoret. Comput. Sci.,118, 21–48 (1993)

    Google Scholar 

  11. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoret. Comput. Sci.24, 83–113 (1984).

    Google Scholar 

  12. Degano, P., De Nicola, De R., Montanari, U.: A partial ordering semantics for CCS. Theoret. Comput. Sci.75, 223–262 (1990)

    Google Scholar 

  13. Hennessy, M.: An algebraic theory of processes. New York: MIT Press, 1988.

    Google Scholar 

  14. Jategaonkar, L.: Personal communication, 1992.

  15. Jategaonkar, L., Meyer, A.: Testing equivalence for petri nets with action refinement. In: Proc. CONCUR92 (Lect. Notes in Comput. Sci., vol. 630, pp. 17–31) Berlin: Springer 1992.

    Google Scholar 

  16. Jategoankar, L., Meyer, A.: Self-synchronisation of concurrent processes. In: Proc. 8th Ann. Symp. on Logic in Computer Science, pp. 409–417, Montreal, Canada, New York: IEEE Computer Society Press 1993.

    Google Scholar 

  17. Janssen, W., Poel, M., Zweirs, J.: Action systems and action refinement in the development of parallel systems. In: Proc. CONCUR91, Theories of Concurrency: Unification and Extension (Lect. Notes in Comput. Sci., vol. 527 pp. 298–316) Berlin: Springer 1991.

    Google Scholar 

  18. Milner, R.: Communication and concurrency. Englewood Cliffs, NJ, Prentice-Hall 1989.

    Google Scholar 

  19. Murphy, D., Pitt, D.: Testing, betting and true concurrency. In: Proc. of Concur. 91 (Lect. Notes in Comput. Sci. vol. 527) 1991.

  20. Stoughton, A.: Fully abstract models of programming languages. Research Notes in Theoretical Computer Science, New York: Pitman/Wiley 1988.

    Google Scholar 

  21. Taubner, D., Vogler, W.: The step failures semantics. In: Brandenburg, F.J. et al., (ed.), Proc. STACS 87, (Lect. Notes in Comput. Sci., vol. 247, pp. 348–359). Berlin: Springer 1987.

    Google Scholar 

  22. van Glabbeek, R.J.: The refinement theorem for ST-bisimulation. In: Proc. IFIP Working Groups, Sea of Galilee, (Lect. Notes in Comput. Sci.) Berlin: Springer 1990.

    Google Scholar 

  23. van Glabbeek, R.J., Vaandrager, F.W.: Petri net models for algebraic theories of concurrency. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) Proc. PARLE Conf. (Lect. Notes in Comput. Sci., vol. 259, pp. 224–242). Berlin: Springer 1987.

    Google Scholar 

  24. van Glabbeek, R.J. Vaandrager, F.W.: The difference between splitting in n and n+1. Presented at the Goslar Workshop on Compositionality and Concurrency, 1991, 1994 (to appear).

  25. Vogler, W.: Bisimulation and action refinement. Technical Report 342/10/90, Technische Universität München, May 1990. Also appeared in the Proc. STACS91.

  26. Vogler, W.: Failure semantics based on interval semiwords is a congruence for refinement. Distributed Comput.4, 139–162 (1991).

    Google Scholar 

  27. Vogler, W.: Is partial order semantics necessary for action refinement? Technical Report 342/1/91 A, Technische Universität München, January 1991.

Download references

Author information

Authors and Affiliations

  1. School of Cognitive and Computing Sciences, University of Sussex, Falmer, BN1 9QH, Brighton, UK

    M. Hennessy

Authors
  1. M. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hennessy, M. Concurrent testing of processes. Acta Informatica 32, 509–543 (1995). https://doi.org/10.1007/BF01178906

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation