This is a preview of subscription content, log in via an institution to check access.
REFERENCES
Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Irredundant Algorithms for Traversing Directed Graphs: The Deterministic Case, Programmirovanie, 2003, no. 5, pp. 11–30.
Lee, D. and Yannakakis, M., Principles and Methods of Testing Finite State Machines: A Survey, Proceedings of the IEEE, vol. 84,no. 8, pp. 1090–1123, Berlin: IEEE Computer Society, 1996.
Von Bochmann, G. and Petrenko, A., Protocol Testing: Review of Methods and Relevance for Software Testing, Proc. of ISSTA, 1994, pp. 109–124.
Burch, J.R., Clark, E.M., McMillan, K.L., and Dill, D.L., Sequential Circuit verification Using Symbolic Model Checking, Proc. of the Design Automation Conf., 1990, pp. 46–51.
Cabodi, G., Lavagno, L., Macci, E., Poncino, M., Quer, S., Camurati, P., and Sentovicha, E., Enhancing FSM Traversal by Temporary Re-Encoding, Proc. of IEEE Int. Conf. on Comput. Design, 1996, pp. 6–11.
Swamy, G.M., Singhal, V., Brayton, R.K., Incremental methods for FSM Traversal, Techn. Report, Electronics Research Lab., Univ. of California, Berkeley, 1995.
Luo, G., Petrenko, A., and von Bochmann, G., Test Selection Based on Communicating Nondeterministic Finite State Machines Using a Generalized Wp-Method, IEEE Trans., 1994,vol. SE-20,no. 2.
Barnett, M., Nachmanson, L., and Schulte, W., Conformance Checking of Components against Their Non-Deterministic Specifications, Microsoft Research Techn. Report MSR-TR-2001-56.
Petrenko, A., Yevtushenko, N., and von Bochmann, G., Testing Deterministic Implementations from Nondeterministic FSM Specifications, Selected Proc. of the IFIP TC6 9th Int. Workshop on Testing of Communicating Systems, 1996.
Fujiwara, S. and von Bochmann, G., Testing Nondeterministic Finite State Machine with Fault Coverage, Proc. of IFIP TC6 Fourth Int. Workshop on Protocol Test Systems, (1991), Kroon, J., Hei-jink, R.J., and Brinksma, E., Eds., North-Holland, 1992, pp. 267–280.
Milner, R., A Calculus of Communicating Systems, in Lecture Notes in Computer Science, Berlin: Springer, 1980, vol. 92.
Tabourier, M., Cavalli, A., and Ionescu, M., A GSM-MAP Protocol Experiment Using Passive Testing, Proc. of the World Congr. on Formal Methods in Development of Computing Systems (FM'99), Toulouse, 1999.
Bourdonov, I.B., Kossatchev, A.S., and Kuliamin, V.V., Use of Finite Automata for Program Testing, Programmirovanie, 2000, no. 2, pp. 12–28.
Gurevich, Yu., Sequential Abstract State Machines Capture Sequential Algorithms, ACM Trans. Computational Logic, 2000, vol. 1,no. 1, pp. 77–111.
http://www.ispras.ru/RedVerst/.
Bourdonov, I, Kossatchev, A., Kuliamin, V., and Petrenko, A., UniTesK Test Suite Architecture, Proc. of FME 2002, Lecture Notes in Computer Science, vol. 2391, pp. 77–88, Berlin: Springer, 2002.
Bourdonov, I., Kossatchev, A., Petrenko, A., and Gatter, D., KVEST: Automated Generation of Test Suites from Formal Specifications, Proc. of FM'99, Lecture Notes in Computer Science, vol. 1708, pp. 608–621, Berlin: Springer, 1999.
Albers, S. and Henzinger, M.R., Exploring Unknown Environments, SIAM J. Comput., 2000, vol. 29,no. 4, pp. 1164–1188.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bourdonov, I.B., Kossatchev, A.S. & Kuliamin, V.V. Irredundant Algorithms for Traversing Directed Graphs: The Nondeterministic Case. Programming and Computer Software 30, 2–17 (2004). https://doi.org/10.1023/B:PACS.0000013436.72070.95
Issue Date:
DOI: https://doi.org/10.1023/B:PACS.0000013436.72070.95