Reaching and distinguishing states of distributed systems

SIAM Journal on Computing

Volumn 39, Issue 8, 2010, Pages 3480-3500

  Hierons, Robert M ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Distributed systems; Finite state machine; Multiport systems; Testing

Indexed keywords

DECISION PROBLEMS; DISTRIBUTED SYSTEMS; FINITE STATE MACHINES; INITIAL STATE; LOW-ORDER POLYNOMIALS; MULTI-PORT; MULTIPORT SYSTEMS; OBSERVABILITY PROBLEMS; TEST GENERATIONS; TWO-STATE;

POLYNOMIAL APPROXIMATION;

CONTOUR FOLLOWERS;

EID: 78751474237     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/090771296     Document Type: Article

References (37)

1. H. ABOELFOTOH, O. ABOU-RABIA, AND H. URAL, A test generation algorithm for protocols modeled as non-deterministic FSMs, The Software Engineering Journal, 8 (1993), pp. 184-188.
2. A. V. AHO, A. T. DAHBURA, D. LEE, AND M. U. UYAR, An optimization technique for protocol conformance test generation based on UIO sequences and Rural Chinese Postman Tours, in Protocol Specification, Testing, and Verification VIII, Elsevier, North-Holland, Amsterdam, 1988, pp. 75-86.
3. R. ALUR, C. COURCOUBETIS, AND M. YANNAKAKIS, Distinguishing tests for nondeterministic and probabilistic machines, in Proceedings of the 27th ACM Symposium on Theory of Computing, Las Vegas, 1995, pp. 363-372.
4. M. BARNETT, W. GRIESKAMP, L. NACHMANSON, W. SCHULTE, N. TILLMANN, AND M. VEANES, Towards a tool environment for model-based testing with AsmL, in Formal Approaches to Testing, Lecture Notes in Comput. Sci. 2931, Springer-Verlag, Montreal, 2003, pp. 252-266.
5. S. BOYD AND H. URAL, The synchronization problem in protocol testing and its complexity, Inform. Process. Lett., 40 (1991), pp. 131-136.
6. L. CACCIARI AND O. RAFIQ, Controllability and observability in distributed testing, Inform. Softw. Technol., 41 (1999), pp. 767-780.
7. A. K. CHANDRA, D. KOZEN, AND L. J. STOCKMEYER, Alternation, J. ACM, 28 (1981), pp. 114-133.
8. W. CHEN AND H. URAL, Synchronizable checking sequences based on multiple UIO sequences, IEEE/ACM Trans. Networking, 3 (1995), pp. 152-157.
9. T. S. CHOW, Testing software design modelled by finite state machines, IEEE Trans. Softw. Engrg., 4 (1978), pp. 178-187.
10. E. D. DEMAINE AND R. A. HEARN, Constraint logic: A uniform framework for modeling computation as games, in Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, College Park, MD, 2008, pp. 149-162.
11. R. DSSOULI AND G. VON BOCHMANN, Error detection with multiple observers, in Protocol Specification, Testing, and Verification V, Elsevier, North-Holland, Amsterdam, 1985, pp. 483-494.
12. R. DSSOULI AND G. VON BOCHMANN, Conformance testing with multiple observers, in Protocol Specification, Testing, and Verification VI, Elsevier, North-Holland, Amsterdam, 1986, pp. 217-229.
13. E. FARCHI, A. HARTMAN, AND S. PINTER, Using a model-based test generator to test for standard conformance, IBM Syst. J., 41 (2002), pp. 89-110.
14. G. GONENC, A method for the design of fault detection experiments, IEEE Trans. Comput., 19 (1970), pp. 551-558.
15. W. GRIESKAMP, Y. GUREVICH, W. SCHULTE, AND M. VEANES, Generating finite state machines from abstract state machines, in Proceedings of the ACM SIGSOFT Symposium on Software Testing and Analysis, Rome, 2002, pp. 112-122.
16. S. HAAR, C. JARD, AND G.-V. JOURDAN, Testing input/output partial order automata, in (TestCom/FATES 2007), Lecture Notes in Comput. Sci. 4581, Springer-Verlag, Berlin, 2007, pp. 171-185.
17. F. C. HENNIE, Fault-detecting experiments for sequential circuits, in Proceedings of the Fifth Annual IEEE Symposium on Switching Circuit Theory and Logical Design, Princeton, NJ, 1964, pp. 95-110.
18. R. M. HIERONS, Controllable testing from nondeterministic finite state machines with multiple ports, submitted.
19. R. M. HIERONS, Testing from a non-deterministic finite state machine using adaptive state counting, IEEE Trans. Comput., 53 (2004), pp. 1330-1342.
20. R. M. HIERONS, Canonical finite state machines for distributed systems, Theoret. Comput. Sci., 411 (2010), pp. 566-580.
21. R. M. HIERONS AND H. URAL, Synchronized checking sequences based on UIO sequences, Inform. Softw. Technol., 45 (2003), pp. 793-803.
22. R. M. HIERONS AND H. URAL, Optimizing the length of checking sequences, IEEE Trans. Comput., 55 (2006), pp. 618-629.
23. R. M. HIERONS AND H. URAL, The effect of the distributed test architecture on the power of testing, The Computer Journal, 51 (2008), pp. 497-510.
24. D. LEE AND M. YANNAKAKIS, Principles and methods of testing finite-state machines-a survey, Proc. IEEE, 84 (1996), pp. 1089-1123.
25. G. LUO, R. DSSOULI, AND G. V. BOCHMANN, Generating synchronizable test sequences based on finite state machine with distributed ports, in Proceedings of the Sixth IFIP Workshop on Protocol Test Systems, Pau, France, Elsevier, North-Holland, 1993, pp. 139-153.
26. G. L. LUO, G. VON BOCHMANN, AND A. PETRENKO, Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method, IEEE Trans. Softw. Engrg., 20 (1994), pp. 149-161.
27. E. F. MOORE, Gedanken-experiments on sequential machines, in Automata Studies, C. Shannon and J. McCarthy, eds., Princeton University Press, Princeton, NJ, 1956, pp. 129-153.
28. G. PETERSON, J. REIF, AND S. AZHAR, Lower bounds for multiplayer noncooperative games of incomplete information, Comput. Math. Appl., 41 (2001), pp. 957-992.
29. G. PETERSON, J. REIF, AND S. AZHAR, Decision algorithms for multiplayer noncooperative games of incomplete information, Comput. Math. Appl., 43 (2002), pp. 179-206.
30. G. L. PETERSON AND J. H. REIF, Multiple-person alternation, in Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, San Juan, Puerto Rico, 1979, pp. 348-363.
31. A. PETRENKO AND N. YEVTUSHENKO, Testing from partial deterministic FSM specifications, IEEE Trans. Comput., 54 (2005), pp. 1154-1165.
32. A. PETRENKO, N. YEVTUSHENKO, AND G. V. BOCHMANN, Testing deterministic implementations from nondeterministic FSM specifications, in Testing of Communicating Systems, IFIP TC6 9th International Workshop on Testing of Communicating Systems, Darmstadt, Germany, 1996, Chapman and Hall, London, pp. 125-141.
33. J. H. REIF, The complexity of two-player games of incomplete information, J. Comput. System Sci., 29 (1984), pp. 274-301.
34. B. SARIKAYA AND G. VON BOCHMANN, Synchronization and specification issues in protocol testing, IEEE Trans. Commun., 32 (1984), pp. 389-395.
35. K.-C. TAI AND Y.-C. YOUNG, Synchronizable test sequences of finite state machines, Computer Networks and ISDN Systems, 30 (1998), pp. 1111-1134.
36. R. TARJAN, Depth-first search and linear graph algorithms, SIAM J. Comput., 1 (1972), pp. 146-160.
37. P. TRIPATHY AND K. NAIK, Generation of adaptive test cases from non-deterministic finite state models, in Proceedings of the Fifth International Workshop on Protocol Test Systems, Montreal, 1992, pp. 309-320.