Login / Signup

A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games.

Le Manh HaVan Trung PhamThi Ha Duong Phan
Published in: RIVF (2012)
Keyphrases
  • petri net
  • computational complexity
  • learning algorithm
  • worst case
  • optimal solution
  • dynamic programming
  • np hard
  • state space
  • knowledge based systems