35 citations · 102 across the 18 of their papers we have counts for
1 paper · 1 filter
Michael Blondin, Alain Finkel, Christoph Haase +1
The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challe…