Finding Stubborn Sets of Coloured Petri Nets without Unfolding

DOI10.1007/3-540-69108-1_7MaRDI QIDQ6487388zbMATH OpenFDO

Authors Lars M. Kristensen, Antti Valmari

Publication date 9 December 2022

Full work available at URL https://doi.org/10.1007/3-540-69108-1_7

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the Computation of Stubborn Sets of Colored Petri Nets
• An efficient algorithm for the computation of stubborn sets of well formed Petri nets
• scientific article; zbMATH DE number 2084348
• Optimized Colored Nets Unfolding
• Question-guided stubborn set methods for state properties

Cites work

• An efficient algorithm for the computation of stubborn sets of well formed Petri nets
• Combining partial-order reductions with on-the-fly model-checking.
• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• scientific article; zbMATH DE number 177254 (Why is no real title available?)
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem

Cited in

(3)

• On the Computation of Stubborn Sets of Colored Petri Nets
• An efficient algorithm for the computation of stubborn sets of well formed Petri nets
• Methods for Efficient Unfolding of Colored Petri Nets

This page was built for publication: Finding Stubborn Sets of Coloured Petri Nets without Unfolding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487388)