Testing k-Safe Petri Nets

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.

[1]  Paul Gastin,et al.  Local Testing of Message Sequence Charts Is Difficult , 2007, FCT.

[2]  Farn Wang.  Formal Techniques for Networked and Distributed Systems - FORTE 2005, 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings , 2005, FORTE.

[3]  Gregor von Bochmann,et al.  Testing Systems Specified as Partial Order Input/Output Automata , 2008, TestCom/FATES.

[4]  Q. M. Tany,et al.  Checking Experiments with Labeled Transition Systems for Trace Equivalence , 2022 .

[5]  Hong Zhu,et al.  A methodology of testing high-level Petri nets , 2002, Inf. Softw. Technol..

[6]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[7]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[8]  Paul Gastin,et al.  A Fresh Look at Testing for Asynchronous Communication , 2006, ATVA.

[9]  Robin Milner.  An Action Structure for Synchronous pi-Calculus , 1993, FCT.

[10]  Robert M. Hierons,et al.  Resolving Observability Problems in Distributed Test Architectures , 2005, FORTE.

[11]  Jens Palsberg,et al.  Complexity Results for 1-Safe Nets , 1993, Theor. Comput. Sci..

[12]  Alexandre Petrenko,et al.  Selecting test sequences for partially-specified nondeterministic finite state machines , 1995 .

[13]  Alexandre Petrenko,et al.  Testing of Software and Communicating Systems , 2007, Lecture Notes in Computer Science.

[14]  David Lee,et al.  Principles and methods of testing finite state machines-a survey , 1996, Proc. IEEE.

[15]  Jörg Desel,et al.  Free Choice Petri Nets (Cambridge Tracts in Theoretical Computer Science) , 2005 .

[16]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[17]  Ferhat Khendek,et al.  Test Selection Based on Finite State Models , 1991, IEEE Trans. Software Eng..

[18]  Gregor von Bochmann,et al.  Generating Synchronizable Test Sequences Based on Finite State Machine with Distributed Ports , 1993, Protocol Test Systems.