PeCAn: Compositional verification of petri nets made easy

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper introduces PeCAn, a tool supporting compositional verification of Petri nets. Beyond classical features (such as onthe- 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.

Cite

CITATION STYLE

APA

Le, D. T., Nguyen, H. V., Nguyen, V. T., Mai, P. N., Pham-Duy, B. T., Quan, T. T., … Liu, Y. (2014). PeCAn: Compositional verification of petri nets made easy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8837, pp. 242–247). Springer Verlag. https://doi.org/10.1007/978-3-319-11936-6_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free