References

  1. F. Aarts & F. W. Vaandrager (2010): Learning I/O Automata. In: Proc. of the 21th Int. Conf. on Concurrency Theory (CONCUR), LNCS 6269. Springer, pp. 71–85, doi:10.1007/978-3-642-15375-4_6.
  2. C. Baier & J.-P. Katoen (2008): Principles of Model Checking. The MIT Press.
  3. H. C. Bohnenkamp & M. I. A. Stoelinga (2008): Quantitative testing. In: Proc. of the 8th ACM & IEEE Int. Conf. on Embedded software (EMSOFT). ACM, pp. 227–236, doi:10.1145/1450058.1450089.
  4. R. De Nicola & R. Segala (1995): A process algebraic view of input/output automata. Theoretical Computer Science 138, pp. 391–423, doi:10.1016/0304-3975(95)92307-J.
  5. N. A. Lynch & M. R. Tuttle (1987): Hierarchical Correctness Proofs for Distributed Algorithms. In: Proc. of the 6th Annual ACM Symp. on Principles of Distributed Computing (PODC), pp. 137–151, doi:10.1145/41840.41852.
  6. R. Segala (1993): Quiescence, Fairness, Testing, and the Notion of Implementation. In: Proc. of 4th Int. Conf. on Concurrency Theory (CONCUR), LNCS 715. Springer, pp. 324–338, doi:10.1007/3-540-57208-2_23.
  7. R. Segala (1997): Quiescence, Fairness, Testing, and the Notion of Implementation. Information and Computation 138(2), pp. 194 – 210, doi:10.1006/inco.1997.2652.
  8. W. G. J. Stokkink, M. Timmer & M. I. A. Stoelinga (2012): Talking quiescence: a rigorous theory that supports parallel composition, action hiding and determinisation (extended version). Technical Report TR-CTIT-12-05. CTIT, University of Twente.
  9. T. A. Sudkamp (2006): Languages and machines. Pearson Addison Wesley.
  10. M. Timmer, H. Brinksma & M. I. A. Stoelinga (2011): Model-Based Testing. In: Software and Systems Safety: Specification and Verification, NATO Science for Peace and Security Series D: Information and Communication Security 30. IOS Press, Amsterdam, pp. 1–32, doi:10.3233/978-1-60750-711-6-1.
  11. G. J. Tretmans (1996): Test Generation with Inputs, Outputs, and Quiescence. In: Proceedings of the 2nd Int. Workshop on Tools and Algorithms for Construction and Analysis of Systems (TACAS), LNCS 1055. Springer, pp. 127–146, doi:10.1007/3-540-61042-1_42.
  12. G. J. Tretmans (1996): Test Generation with Inputs, Outputs and Repetitive Quiescence. Software - Concepts and Tools 17(3), pp. 103–120.
  13. G. J. Tretmans (2008): Model Based Testing with Labelled Transition Systems. In: Formal Methods and Testing, LNCS 4949. Springer, pp. 1–38, doi:10.1007/978-3-540-78917-8_1.
  14. F. W. Vaandrager (1991): On the Relationship Between Process Algebra and Input/Output Automata (Extended Abstract). In: Proc. of 6th Annual Symposium on Logic in Computer Science (LICS). IEEE, pp. 387–398, doi:10.1109/LICS.1991.151662.
  15. H. M. van der Bijl, A. Rensink & G. J. Tretmans (2004): Compositional Testing with ioco. In: Formal Approaches to Software Testing (FATES), LNCS 2931. Springer Verlag, Berlin, pp. 86–100, doi:10.1007/978-3-540-24617-6_7.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org