Experimenting with stubborn sets on Petri nets

DOI10.1007/978-3-031-33620-1_19zbMATH Open1541.68246MaRDI QIDQ6535200FDOQ6535200

Authors: Sami Evangelista 

Publication date: 16 November 2023

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

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)

Cites Work

• Applications and Theory of Petri Nets 2005
• Nested-unit Petri nets
• Title not available (Why is that?)
• Can stubborn sets be optimal?
• Model Checking Software
• An efficient partial order reduction algorithm with an alternative proviso implementation
• Title not available (Why is that?)
• Stubborn sets for simple linear time properties
• On the binomial formula.
• Exploring the scope for partial order reduction
• Model Checking Software

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)