Efficient implementation of coverability verification on communication-free Petri net

DOI10.13328/J.CNKI.JOS.005750zbMATH Open1449.68051MaRDI QIDQ5209965FDOQ5209965

Authors: Rujiang Ding, Guoqiang Li 

Publication date: 22 January 2020

Recommendations

• Approaching the coverability problem continuously
• An SMT-based approach to coverability analysis
• scientific article; zbMATH DE number 6831517

zbMATH Keywords

verificationmodel checkingcoverabilitycommunication-free Petri net

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)

Cited In (6)

• Small vertex cover makes Petri net coverability and boundedness easier
• Approaching the coverability problem continuously
• Occam's razor applied to the Petri net coverability problem
• An SMT-based approach to coverability analysis
• Closed Covers: To Verify Progress for Communicating Finite State Machines
• Applying Step Coverability Trees to Communicating Component-Based Systems

This page was built for publication: Efficient implementation of coverability verification on communication-free Petri net

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