Saturation Enhanced with Conditional Locality: Application to Petri Nets

DOI10.1007/978-3-030-21571-2_19MaRDI QIDQ6184729zbMATH OpenFDO

Authors Vince Molnár, István Majzik

Publication date 29 January 2024

Published in Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-21571-2_19

zbMATH Keywords

conditional localityformal verificationgeneralized saturationsymbolic model checking

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

• scientific article; zbMATH DE number 1956594
• scientific article; zbMATH DE number 1701768
• Correct Hardware Design and Verification Methods
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• Ten years of saturation: a Petri net perspective

Cites work

• Component-wise incremental LTL model checking
• Correct Hardware Design and Verification Methods
• Getting the priorities right: saturation for prioritised Petri nets
• Hierarchical Set Decision Diagrams and Automatic Saturation
• scientific article; zbMATH DE number 1701768 (Why is no real title available?)
• Symbolic CTL model checking of asynchronous systems using constrained saturation
• Symbolic model checking: \(10^{20}\) states and beyond

Cited in

(1)

• Improving Saturation Efficiency with Implicit Relations

This page was built for publication: Saturation Enhanced with Conditional Locality: Application to Petri Nets

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