Login / Signup

A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets.

Kamel BarkaouiMichel Minoux
Published in: Application and Theory of Petri Nets (1992)
Keyphrases
  • petri net
  • computational complexity
  • worst case
  • np hard
  • polynomial time complexity
  • learning environment
  • knowledge representation
  • graph structure
  • weighted graph