Cunf: A Tool for Unfolding and Verifying Petri Nets with Read Arcs
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.
Unable to display preview. Download preview PDF.
- 2.Baldan, P., Corradini, A., König, B., Schwoon, S.: McMillan’s complete prefix for contextual nets. In: Jensen, K., van der Aalst, W.M.P., Billington, J. (eds.) ToPNoC I. LNCS, vol. 5100, pp. 199–220. Springer, Heidelberg (2008)Google Scholar
- 3.Cosyverif Project: Cosyverif http://www.cosyverif.org
- 5.LIP6/MoVe Team: Coloane, http://coloane.lip6.fr/
- 8.Rodríguez, C.: Cunf, http://www.lsv.ens-cachan.fr/~rodriguez/tools/cunf/