Verification of Petri nets with read arcs

DOI10.1007/978-3-642-32940-1_33MaRDI QIDQ2912697zbMATH OpenOpenAlexFDO

Authors César Rodríguez, Stefan Schwoon

Publication date 25 September 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32940-1_33

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

• Construction and SAT-based verification of contextual unfoldings
• Efficient unfolding of contextual Petri nets
• SAT-solving the coverability problem for Petri nets
• Efficient Contextual Unfolding
• scientific article; zbMATH DE number 1799527

Cited in

(8)

• Efficiency of asynchronous systems and read arcs in petri nets
• Equivalence checking of Petri net models of programs using static and dynamic cut-points
• Arc-typed Petri Nets
• Efficient unfolding of contextual Petri nets
• Cunf: a tool for unfolding and verifying Petri nets with read arcs
• Verification of Timed-Arc Petri Nets
• Construction and SAT-based verification of contextual unfoldings
• Non-atomic transition firing in contextual nets

Describes a project that uses

Uses Software

• MiniSat
• Punf

This page was built for publication: Verification of Petri nets with read arcs

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