My research is mainly focused on generating test sequences automatically using Colored Petri net.CFG provides techniques for generating test sequences. But some papers says that, test sequence generation methods based on a control flow graph sometimes suffers from a feasibility problem (i.e. some paths in a CFG may not be feasible).So I need a technique to draw a Control flow graph from the Colored Petri net model, in a way that, when I will select paths from the control-flow graph it will contain only the feasible paths.Then I will generate test sequences from the CFG. Can anyone help me finding any technique please or give me any suggession??
4
-
$\begingroup$ Have you asked your advisor? $\endgroup$– JuhoNov 9, 2015 at 14:26
-
$\begingroup$ My research is mainly focused on generating test sequences automatically using Colored Petri net.CFG provides techniques for generating test sequences. But some papers says that, test sequence generation methods based on a control flow graph sometimes suffers from a feasibility problem (i.e. some paths in a CFG may not be feasible). As rechability graphs takes only feasible paths so I figured out if I can generate a CFG from the RG then every path will be feasible.So I need a technique to draw a Control flow graph from the Rechability graph.Then I will generate test sequences from the CFG. $\endgroup$– Nitu08Nov 10, 2015 at 8:29
-
$\begingroup$ Sounds like an instance of an XY problem. Sounds like what you really need is a way to generate a control-flow graph for a Petri net, in a way that doesn't "suffer from a feasibility problem" (whatever that means -- I think you need to make that more precise). Whether it's via a reachability graph or some other way presumably doesn't matter if it achieves that goal. Is that right? If so, can you edit your question to focus on the goal without making unwarranted assumptions about what kind of method will be needed to achieve that goal? $\endgroup$– D.W. ♦Nov 11, 2015 at 7:21
-
$\begingroup$ Actually yes, I need a technique to generate a control-flow graph for a Colored Petri net, in a way that, when I will select paths from the control-flow graph it will not contain any infeasible path. Can you please suggest me any technique? $\endgroup$– Nitu08Nov 11, 2015 at 9:01
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
Since you are interested in generating test sequences automatically using colored Petri nets, note that it's not clear that you need reduction to control flow graphs (and dealing with all the related issues). Some techniques were presented, that use various different methods to generate test sequences from Petri nets. Some examples include:
On the other hand, since Petri nets and control flow graphs are not semantically equivalent in general (and capture different type of information), the translation between the two is usually done in some specific domain (and restrictions). (Although usually, control flow graphs can be transformed into equivalent Petri nets.). Some examples and discussions are given in:
The Design Of A General Method For Constructing Coupled Scientific Simulations, Matthew J. Sottile
Note that your question seems a bit too general. (Moreover, it also seems as an instance of XY, as noted by D.W.) Without more details, it seems hard to give a concrete and concise answer. Hopefully, given pointers can get you closer to your desired goal.
