Abstract
This paper introduces PeCAn, a tool supporting compositional verification of Petri nets. Beyond classical features (such as on-the-fly analysis and synchronisation between multiple Petri nets), PeCAn generates Symbolic Observation Graphs (SOG), and uses their composition to support modular abstractions of multiple Petri nets for more efficient verification. Furthermore, PeCAn implements an incremental strategy based on counter-examples for model-checking, thus improving significantly the cost of execution time and memory space. PeCAn also provides users with the visualisation of the input Petri nets and their corresponding SOGs. We experimented PeCAn with benchmark datasets from the Petri Nets’ model checking contests, showing promising results.
This work is partially supported by the STIC-Asie project CATS (“Compositional Analysis of Timed Systems”).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
André, É., Hillah, L.-M., Hulin-Hubard, F., Kordon, F., Lembachar, Y., Linard, A., Petrucci, L.: CosyVerif: An open source extensible verification environment. In: ICECCS, pp. 33–36. IEEE Computer Society (2013)
André, É., Klai, K., Ochi, H., Petrucci, L.: A counterexample-based incremental and modular verification approach. In: Calinescu, R., Garlan, D. (eds.) Monterey Workshop 2012. LNCS, vol. 7539, pp. 283–302. Springer, Heidelberg (2012)
Byg, J., Jørgensen, K.Y., Srba, J.: TAPAAL: Editor, simulator and verifier of timed-arc Petri nets. In: Liu, Z., Ravn, A.P. (eds.) ATVA 2009. LNCS, vol. 5799, pp. 84–89. Springer, Heidelberg (2009)
Haddad, S., Ilié, J.-M., Klai, K.: Design and evaluation of a symbolic and abstraction-based model checker. In: Wang, F. (ed.) ATVA 2004. LNCS, vol. 3299, pp. 196–210. Springer, Heidelberg (2004)
Heiner, M., Richter, R., Schwarick, M.: Snoopy: A tool to design and animate/simulate graph-based formalisms. In: SimuTools, vol. 15 (2008)
Kordon, F., Linard, A., Beccuti, M., Buchs, D., Fronc, L., Hillah, L.-M., Hulin-Hubard, F., Legond-Aubry, F., Lohmann, N., Marechal, A., Paviot-Adet, E., Pommereau, F., Rodríguez, C., Rohr, C., Thierry-Mieg, Y., Wimmel, H., Wolf, K.: Model checking contest @ Petri nets, report on the 2013 edition. CoRR, abs/1309.2485 (2013)
Kozura, V.E., Nepomniaschy, V.A., Novikov, R.M.: Verification of distributed systems modelled by high-level Petri nets. In: PARELEC, pp. 61–66 (2002)
Lakos, C., Petrucci, L.: Modular state spaces for prioritised Petri nets. In: Calinescu, R., Jackson, E. (eds.) Monterey Workshop 2010. LNCS, vol. 6662, pp. 136–156. Springer, Heidelberg (2011)
Le, D.-T.: PeCAn Web page (2014), http://cse.hcmut.edu.vn/~save/project/pn-ver/start
Schmidt, K.: Distributed verification with LoLA. Fund. Inf. 54(2-3), 253–262 (2003)
Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards flexible verification under fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709–714. Springer, Heidelberg (2009)
Westergaard, M.: CPN Tools 4: Multi-formalism and extensibility. In: Colom, J.-M., Desel, J. (eds.) PETRI NETS 2013. LNCS, vol. 7927, pp. 400–409. Springer, Heidelberg (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Le, DT. et al. (2014). PeCAn: Compositional Verification of Petri Nets Made Easy. In: Cassez, F., Raskin, JF. (eds) Automated Technology for Verification and Analysis. ATVA 2014. Lecture Notes in Computer Science, vol 8837. Springer, Cham. https://doi.org/10.1007/978-3-319-11936-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-11936-6_18
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11935-9
Online ISBN: 978-3-319-11936-6
eBook Packages: Computer ScienceComputer Science (R0)