To prevent spam users, you can only post on this forum after registration, which is by invitation. If you want to post on the forum, please send me a mail (h DOT m DOT w DOT verbeek AT tue DOT nl) and I'll send you an invitation in return for an account.
Show all possible traces for a given petri net
might be a trivial question, but I have not yet found any solution...
Is there an automatism to derive all possible traces which can be generated by a given (not very complex) petri net? I have discovered a few simple models for which I want to know the possible traces. Because the models do not contain loops, it should be a finite set. (However loops could also be expressed by e.g. using a regular expression like asteriks (AB*C = ABC, ABBC, ABBBC, ABBBBC, ....). By looking at the set of possible traces I could verify whether the model is over- or undergeneralizing.
So far I have looked into transition systems (hard to read) and also the unfolding plugins available in ProM 6. Neither has given me the desired information. Knowing which traces can in theory be generated by a specific petri net would support people not acquainted with petri nets and creates a better understanding of the model behaviour (at least for not very complex petri nets, e.g. with a dozen possible traces).
Would it in principle be feasible to derive all possible traces in a petri net using a combined depth-first search / repeated token game approach? Sorry if this is a really stupid question...
Does anybody know how to handle this or can anyone point out some keywords which I could use for further research towards a solution?
Thank you very much in advance,