A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
Coloured Petri Nets, Modelling and Validation of Concurrent Systems
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
-
A rewriting-logic-with-SMT-based formal analysis and parameter synthesis framework for parametric time Petri nets
A Maude-with-SMT framework for sound and complete formal analysis and parameter synthesis of parametric time Petri nets, including a folding approach that terminates on finite parametric state-class graphs and support for LTL model checking.
-
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.