Cunf: a tool for unfolding and verifying Petri nets with read arcs

DOI10.1007/978-3-319-02444-8_42MaRDI QIDQ5166715zbMATH OpenOpenAlexFDO

Authors César Rodríguez, Stefan Schwoon

Publication date 8 July 2014

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02444-8_42

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
• scientific article; zbMATH DE number 1304999
• Verification of Petri nets with read arcs
• Efficient Contextual Unfolding

Cited in

(6)

• Model checking \(\omega \)-regular properties with decoupled search
• Star-Topology Decoupling in SPIN
• Concurrency in Boolean networks
• Star-topology decoupled state space search
• Taking complete finite prefixes to high level, symbolically
• Non-interference by unfolding

Describes a project that uses

Uses Software

• CosyVerif
• Cunf

This page was built for publication: Cunf: a tool for unfolding and verifying Petri nets with read arcs

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