×

Cunf: a tool for unfolding and verifying Petri nets with read arcs. (English) Zbl 1410.68237

Hung, Dang Van (ed.) et al., Automated technology for verification and analysis. 11th international symposium, ATVA 2013, Hanoi, Vietnam, October 15–18, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8172, 492-495 (2013).
Summary: Cunf is a tool for building and analyzing unfoldings of Petri nets with read arcs. An unfolding represents the behaviour of a net by a partial order, effectively coping with the state-explosion problem stemming from the interleaving of concurrent actions. C-net unfoldings can be up to exponentially smaller than Petri net unfoldings, and recent work proposed algorithms for their construction and verification. Cunf is the first implementation of these techniques, it has been carefully engineered and optimized to ensure that the theoretical gains are put into practice.
For the entire collection see [Zbl 1291.68023].

MSC:

68Q60 Specification and verification (program logics, model checking, etc.)
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Software:

Cunf; CosyVerif
PDFBibTeX XMLCite
Full Text: DOI