Parallel computation of the reachability graph of petri net models with semantic information. (23rd September 2016)

• Record Type: Journal Article
• Authors: González‐López de Murillas, Eduardo; Fabra, Javier; Álvarez, Pedro; Ezpeleta, Joaquín
• Is Part Of: Software, practice & experience. Volume 47:Number 5(2017)
• Page Start: 647
• Page End: 668
• Publication Date: 2016-09-23
• Subjects: petri nets -- reachability graph -- semantics -- parallel computing -- high‐perfomance computing -- cloud computing; Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2438
• Languages: English
• ISSNs: 0038-0644

Abstract

Summary: Formal verification plays a crucial role when dealing with correctness of systems. In a previous work, the authors proposed a class of models, the Unary Resource Description Framework Petri Nets (U‐RDF‐PN), which integrated Petri nets and (RDF‐based) semantic information. The work also proposed a model checking approach for the analysis of system behavioural properties that made use of the net reachability graph. Computing such a graph, specially when dealing with high‐level structures as RDF graphs, is a very expensive task that must be considered. This paper describes the development of a parallel solution for the computation of the reachability graph of U‐RDF‐PN models. Besides that, the paper presents some experimental results when the tool was deployed in cluster and cloud frameworks. The results not only show the improvement in the total time required for computing the graph, but also the high scalability of the solution, which make it very useful thanks to the current (and future) availability of cloud infrastructures. Copyright © 2016 John Wiley & Sons, Ltd.