Experimenting with stubborn sets on Petri nets

DOI10.1007/978-3-031-33620-1_19MaRDI QIDQ6535200zbMATH OpenFDO

Authors Sami Evangelista

Publication date 16 November 2023

Full work available at URL https://doi.org/10.1007/978-3-031-33620-1_19

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

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

Cites work

• An efficient partial order reduction algorithm with an alternative proviso implementation
• Applications and Theory of Petri Nets 2005
• Can stubborn sets be optimal?
• Exploring the scope for partial order reduction
• scientific article; zbMATH DE number 1696461 (Why is no real title available?)
• scientific article; zbMATH DE number 177511 (Why is no real title available?)
• Model Checking Software
• Model Checking Software
• Nested-unit Petri nets
• On the binomial formula.
• Stubborn sets for simple linear time properties

Cited in

(1)

• Stubborn Sets, Frozen Actions, and Fair Testing

This page was built for publication: Experimenting with stubborn sets on Petri nets

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