A Theory of Testing High Level Petri Nets
Hong Mei Zhu, Xudong He · 2000
A high-level Petri net can be viewed as an abstract concurrent program and thus can be tested. In this paper, we present a theory of testing high-level Petri nets by adapting some of our general results in testing concurrent software systems. We propose a set of schemes to observe and record testing results and a set of coverage criteria to measure the testing adequacy of given Petri nets. We show the subsuming relationships among the proposed coverage criteria. 1. Introduction High-level Petri nets have been extensively used in concurrent and distributed system modeling and analysis in recent years. Although there are several well-known existing formal analysis techniques such as coverability tree (or graph) technique and invariant techniques, these techniques are not always applicable or effective, and often very difficult to use. On the other hand, testing has been proven to be effective in detecting system errors and is easy to apply. We believe that a testing technique for h...