Extends complete finite prefixes to symbolic unfoldings of high-level Petri nets by generalizing Esparza et al.'s algorithm for safe nets, with prototype evaluation on four new benchmark families and an extension to certain infinite-marking nets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Taking Complete Finite Prefixes To High Level, Symbolically
Extends complete finite prefixes to symbolic unfoldings of high-level Petri nets by generalizing Esparza et al.'s algorithm for safe nets, with prototype evaluation on four new benchmark families and an extension to certain infinite-marking nets.