
Dr. He is collaborating with Dr. Hong Zhu at the Oxford Brookes University in England in developing a theory for testing concurrent software systems. This research is partially supported by the National Science Foundation under grant # INT 9731620. We have developed a general theory of testing concurrent software systems and a method for testing highlevel Petri nets. We used a complete partially ordered set notation to formally define a proper behavior observation and recording scheme and the desirable properties (also called assumptions) the scheme needs to satisfy. Let N be a predicate transition net, M_{0} be the set of initial markings of N, M_{0} is thus the set of test cases for N. An execution of N on test case m_{0} is a sequence of reachable markings starting from m_{0 }and linked by transition firings. We denote such an execution as follows: , where n_{i} are transitions, m_{0Î }M_{0} is an initial marking, m_{i}, i=1,2,…, are markings such that m_{i }is obtained from m_{i1 }by firing transition n_{i}.
Complete Scheme of Behaviour Observation The complete scheme y _{N }=(, Y _{N}) of observable behavior and a recording function Y _{N} of a given predicate transition net N is inductively defined as follows:
Intuitively, the complete scheme of behavior observation records every detail of the executions of a concurrent system. We proved the subsuming relationships among various proposed testing adequacy criteria shown in the following Figure.
Currently, we are adapting the above results to test software architectures defined in SAM. For problems or questions about this web, contact webmaster@cadse.cs.fiu.edu 