Abstract
Petri nets have been widely studied as tool for specification, modeling and analysis of concurrent systems. However, surprisingly little research has been done for testing systems that are specified with Petri nets. When a formal model is used, variations of Finite State Machines are often used for the automated generation of test cases. In this paper, we study automated conformance testing when the formal specification is given as a k-safe Petri net. We provide a general framework to perform these tests, and give a few algorithms for test case generation based on different assumptions. We provide two inefficient, but general algorithms for k-safe Petri net conformance testing. We also provide efficient algorithms for testing k-safe free-choice Petri nets under specific fault assumptions.
Chapter PDF
References
Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines – a survey. Proceedings of the IEEE 84(8), 1089–1123 (1996)
Luo, G., Dssouli, R., Bochmann, G.v., Ventakaram, P., Ghedamsi, A.: Generating synchronizable test sequences based on finite state machines with distributed ports. In: IFIP Sixth International Workshop on Protocol Test Systems, Pau, France, September 1993, pp. 53–68 (1993)
Chen, J., Hierons, R.M., Ural, H.: Resolving observability problems in distributed test architectures. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 219–232. Springer, Heidelberg (2005)
von Bochmann, G., Haar, S., Jard, C., Jourdan, G.-V.: Testing Systems Specified as Partial Order Input/Output Automata. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds.) TestCom/FATES 2008. LNCS, vol. 5047, pp. 169–183. Springer, Heidelberg (2008)
Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)
van der Aalst, W., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Transactions on Knowledge and Data Engineering 16(9), 1128–1142 (2004)
Bhateja, P., Gastin, P., Mukund, M.: A Fresh Look at Testing for Asynchronous Communication. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 369–383. Springer, Heidelberg (2006)
Bhateja, P., Gastin, P., Mukund, M., Kumar, K.N.: Local Testing of Message Sequence Charts Is Difficult. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 76–87. Springer, Heidelberg (2007)
Haar, S.: Law and Partial Order. Nonsequential Behaviour and Probability in Asynchronous Systems. In: Habilitation à diriger les recherches, INRIA (2008), http://www.lsv.ens-cachan.fr/~haar/HDR.pdf
Zhu, H., He, X.: A methodology of testing high-level Petri nets. Information and Software Technology 44(8), 473–489 (2002)
Desel, J., Esparza, J.: Free choice Petri nets. Cambridge Tracts In Theoretical Computer Science 40 (1995) ISBN:0-521-46519-2
Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoretical Computer Science 147(1-2), 117–136 (1995)
Fujiwara, S., Bochmann, G.v., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Transactions on Software Engineering 17(6), 591–603 (1991)
Luo, G., Petrenko, A., Bochmann, G.v.: Selecting test sequences for partially-specified nondeterministic finite state machines. In: Proc. of the International Workshop on Protocol Test Systems (IWPTS 1994), Tokyo, Japan, November, 1994, pp. 95–110 (1994)
Tan, Q.M., Petrenko, A., Bochmann, G.v.: Checking experiments with labeled transition systems for trace equivalence. In: Proc. IFIP 10th Intern. Workshop on Testing of Communication Systems (IWTCS 1997), Cheju Island, Korea (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
von Bochmann, G., Jourdan, GV. (2009). Testing k-Safe Petri Nets. In: Núñez, M., Baker, P., Merayo, M.G. (eds) Testing of Software and Communication Systems. FATES TestCom 2009 2009. Lecture Notes in Computer Science, vol 5826. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05031-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-05031-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05030-5
Online ISBN: 978-3-642-05031-2
eBook Packages: Computer ScienceComputer Science (R0)