Hello everybody, I'm urgently looking for literature about conflict-free petri nets with weighted arcs. I.e.: in contrast to the widely-used definition of conflict-freeness also the arcs going from a place to a transition may have weights greater than 1.
There doesn't seem to be too much material about this topic. So I'd be very glad if someone could refer me to appropriate papers - especially those dealing with the reachability/coverability/boundedness problem. I'd also be pleased about contact to someone who's also interested into this class of petri nets. Thank you very much for your help, Cathrin Theil [EMAIL PROTECTED] ---- [[ 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] ]]
