An O(|S|×|T|)- Algorithm to Verify if a Net is Regular.
Andrei KovalyovPublished in: Application and Theory of Petri Nets (1996)
Keyphrases
- dynamic programming
- learning algorithm
- objective function
- high accuracy
- computational cost
- improved algorithm
- detection algorithm
- computationally efficient
- expectation maximization
- cost function
- single pass
- search space
- preprocessing
- computational complexity
- recognition algorithm
- experimental study
- theoretical analysis
- experimental evaluation
- np hard
- simulated annealing
- machine learning
- search algorithm
- energy function
- times faster
- significant improvement
- multiscale