Experimenting with stubborn sets on Petri nets

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

Sami Evangelista

Publication date: 16 November 2023

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the binomial formula.
• An efficient partial order reduction algorithm with an alternative proviso implementation
• Nested-unit Petri nets
• Stubborn Sets for Simple Linear Time Properties
• Can Stubborn Sets Be Optimal?
• Exploring the Scope for Partial Order Reduction
• Model Checking Software
• Applications and Theory of Petri Nets 2005
• Model Checking Software

Related Items (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)