A Fresh Look at Testing for Asynchronous Communication

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4218)


Testing is one of the fundamental techniques for verifying if a computing system conforms to its specification. We take a fresh look at the theory of testing for message-passing systems based on a natural notion of observability in terms of input-output relations. We propose two notions of test equivalence: one which corresponds to presenting all test inputs up front and the other which corresponds to interactively feeding inputs to the system under test. We compare our notions with those studied earlier, notably the equivalence proposed by Tretmans. In Tretmans’ framework, asynchrony is modelled using synchronous communication by augmenting the state space of the system with queues. We show that the first equivalence we consider is strictly weaker than Tretmans’ equivalence and undecidable, whereas the second notion is incomparable. We also establish (un)decidability results for these equivalences.


Transition System Label Transition System Process Algebra Asynchronous Communication Outgoing Transition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berstel, J.: Transductions and Context-Free Languages, Teubner Studienbücher, Informatik (1979)Google Scholar
  2. 2.
    Boreale, M., de Nicola, R., Pugliese, R.: Trace and Testing Equivalence in Asynchronous Processes. Inf. and Comput. 172, 139–164 (2002)zbMATHCrossRefGoogle Scholar
  3. 3.
    Bourdonov, I.B., Kossatchev, A.S., Kuliamin, V.V.: Formal Conformance Testing of Systems with Refused Inputs and Forbidden Actions. In: MBT 2006. ENTCS, Vienna, Austria, Elsevier, Amsterdam (2006)Google Scholar
  4. 4.
    Castellani, I., Hennessy, M.: Testing Theories for Asynchronous Languages. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 90–101. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  5. 5.
    de Boer, F.S., Klop, J.W., Palamidessi, C.: Asynchronous communication in process algebra. In: Proc. 7th IEEE Logics in Computer Science (LICS), pp. 137–147. IEEE Computer Society Press, Los Alamitos (1992)Google Scholar
  6. 6.
    de Boer, F.S., Kok, J.N., Palamidessi, C., Rutten, J.J.M.M.: The failure of failures: Towards a paradigm for asynchronous communication. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527, pp. 111–126. Springer, Heidelberg (1991)Google Scholar
  7. 7.
    de Nicola, R., Hennessy, M.: Testing equivalences for processes. Theor. Comput. Sci. 34, 83–133 (1984)zbMATHCrossRefGoogle Scholar
  8. 8.
    van Glabbeek, R.J.: The linear time-branching time spectrum I: The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3–99. Elsevier, Amsterdam (2001)CrossRefGoogle Scholar
  9. 9.
    Henniger, O.: On test case generation from asynchronously communicating state machines. In: Proc. IWTCS 1997, Cheju Island, South Korea (1997)Google Scholar
  10. 10.
    Henriksen, J.G., Mukund, M., Narayan Kumar, K., Sohoni, M., Thiagarajan, P.S.: A Theory of Regular MSC Languages. Inf. and Comput. 202(1), 1–38 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    ITU-TS Recommendation Z.120: Message Sequence Chart (MSC). ITU-TS, Geneva (1997)Google Scholar
  12. 12.
    Jard, C.: Synthesis of distributed testers from true-concurrency models of reactive systems. Information & Software Technology 45(12), 805–814 (2003)CrossRefGoogle Scholar
  13. 13.
    Jard, C., Jéron, T.: TGV: theory, principles and algorithms. Software Tools for Technology Transfer 7(4), 297–315 (2005)CrossRefGoogle Scholar
  14. 14.
    Petrenko, A., Yevtushenko, N., Huo, J.L.: Testing Transition Systems with Input and Output Testers. In: Hogrefe, D., Wiles, A. (eds.) TestCom 2003. LNCS, vol. 2644, pp. 129–145. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Sakarovitch, J.: Eléments de théorie des automates, Vuibert (2003)Google Scholar
  16. 16.
    Tretmans, J.: A formal approach to conformance testing, PhD Thesis, University of Twente, The Netherlands (1992)Google Scholar
  17. 17.
    Tretmans, J.: Test Generation with Inputs, Outputs and Repetitive Quiescence. Software—Concepts and Tools 17(3), 103–120 (1996)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Chennai Mathematical InstituteChennaiIndia
  2. 2.LSVENS de Cachan & CNRSFrance

Personalised recommendations