A Polynomial-Time Algorithm for Detecting Potentially Unbounded Places in a Petri Net-Based Concurrent System.
Marcin WojnakowskiRemigiusz WisniewskiMateusz PoplawskiPublished in: Euro-Par Workshops (2023)
Keyphrases
- worst case
- experimental evaluation
- learning algorithm
- detection algorithm
- high accuracy
- theoretical analysis
- times faster
- cost function
- recognition algorithm
- search space
- improved algorithm
- np hard
- lower bound
- optimal solution
- objective function
- bayesian networks
- matching algorithm
- space complexity
- optimization algorithm
- polynomial time complexity
- data sets
- graph cuts
- expectation maximization
- linear programming
- simulated annealing
- upper bound
- dynamic programming
- preprocessing
- similarity measure
- neural network