Coverability in Well-Formed Free-Choice Petri Nets
摘要
This paper recalls Hack’s two coverability theorems for free-choice Petri nets as well as the history of some of their proofs. It also describes two relatively short, symmetric, and partly novel, proofs.