Login / Signup

Detecting Existence of Cycles in Petri Nets - An Algorithm that Computes Non-redundant (Nonzero) Parts of Sparse Adjacency Matrix.

Reggie Davidrajuh
Published in: SOCO-CISIS-ICEUTE (2016)
Keyphrases
  • petri net
  • dynamic programming
  • optimal solution
  • k means
  • worst case
  • segmentation algorithm
  • adjacency matrix
  • machine learning
  • pattern recognition
  • shortest path
  • tree structure
  • weighted graph