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.
Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2verdicts
UNVERDICTED 2representative citing papers
Two complementary static analysis methods for colored Petri net unfolding reduce net size via equivalence classes and color overapproximation, outperforming prior tools on MCC benchmarks in size and solved queries.
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.
-
Methods for Efficient Unfolding of Colored Petri Nets
Two complementary static analysis methods for colored Petri net unfolding reduce net size via equivalence classes and color overapproximation, outperforming prior tools on MCC benchmarks in size and solved queries.