Project and Conquer: Fast Quantifier Elimination for Checking Petri Nets Reacha...
summary
Method projects reachability queries from an original Petri net onto a reduced net by eliminating existential Presburger variables with a tailored quantifier-elimination semi-procedure, building a token-flow graph, substituting sum/equality constraints and using polarization to maximize literals. Procedure runs in linear time on that graph, is sound, detects when projection is exact, and yields practical gains: projects 99.5% of formulas in under 1 minute versus 61% for ISL and enables about +5.5% more solved queries in the model-checking contest.
AI-written summary · about