Parallel computation of the reachability graph of petri net models with semantic information
| Autor: | Javier Fabra, Joaquín Ezpeleta, Pedro Álvarez, Eduardo González López de Murillas |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Model checking
Correctness Graph database Theoretical computer science business.industry Computer science Distributed computing 020207 software engineering Cloud computing 02 engineering and technology Petri net computer.software_genre Graph Reachability 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) 020201 artificial intelligence & image processing business Formal verification computer Software |
| Zdroj: | Software: Practice and Experience. 47:647-668 |
| ISSN: | 0038-0644 |
| DOI: | 10.1002/spe.2438 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text