FoldA computes optimal partial-order alignments by cost-directed Petri net unfoldings, reducing queued states at the price of higher computation time.
Master’s thesis, Utrecht University (2024)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
FoldA: Computing Partial-Order Alignments Using Directed Net Unfoldings
FoldA computes optimal partial-order alignments by cost-directed Petri net unfoldings, reducing queued states at the price of higher computation time.