I am trying to implement this petri net simulator. Amongst it’s specifications it has to return a map of reachable markings from the current state. I don’t really want it to give me an OutOfMemoryError or something if I’m given a petri net with infinite reachable markings. Can this be resolved more elegantly? In my … Continue reading "Is there a realistically implementable algorithm for testing the termination of a given petri net?"
The post Is there a realistically implementable algorithm for testing the termination of a given petri net? appeared first on 100% Private Proxies - Fast, Anonymous, Quality, Unlimited USA Private Proxy!.
