|
Dear Petre netter,
At present stage of our research we use CP-nets and need to make sure
whether or not a particular marking, which is always dead
marking, is reachable from the initial marking. We are curious to ask
whether there is a theoretical or practical way to prove or disprove the
reachability in CP-nets . In ordinary Petri nets one can use the
method of matrix invariants to investigate reachability proıperty and
obtain irrefragable answer to the question. How about CP-nets?
Thank in advance.
Rza Bashirov
Eastern Merditerranean University |
---- [[ Petri Nets World: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/ ]] [[ Mailing list FAQ: ]] [[ http://www.informatik.uni-hamburg.de/TGI/PetriNets/pnml/faq.html ]] [[ Post messages/summary of replies: ]] [[ [email protected] ]]
