Parallel computation of the reachability graph of petri net models with semantic information
Authors: 
Eduardo González-LópezźdeźMurillas, Javier Fabra, Pedro Álvarez, Joaquín EzpeletaAuthors Info & Claims
Eduardo González-LópezźdeźMurillas, Javier Fabra, Pedro Álvarez, Joaquín EzpeletaAuthors Info & ClaimsAbstract
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.
References
[1]
Papazoglou MP, Traverso P, Dustdar S, Leymann F. Service-oriented computing: state of the art and research challenges. IEEE Computer 2007; Volume 40: pp.38-45.
[2]
Murata T. Petri nets: properties, analysis and applications. Proceedings of the IEEE 1989; Volume 77 Issue 4: pp.541-580.
[3]
Girault C, Valk R. Petri Nets for System Engineering: A Guide to Modeling, Verification, and Applications. Springer-Verlag, New York, Inc., 2001.
[4]
<familyNamePrefix>van</familyNamePrefix>Hee KM, Sidorova N, van¿der Werf J. Business process modeling using Petri nets. In Transactions on Petri Nets and Other Models of Concurrency VII, vol.¿Volume 7480, <bookSeriesTitle>Lecture Notes in Computer Science</bookSeriesTitle>. Springer, Berlin Heidelberg, 2013; pp.116-161.
[5]
Li X, Fan Y, Sheng QZ, Maamar Z, Zhu H. A Petri net approach to analyzing behavioral compatibility and similarity of web services. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans May 2011; Volume 41 Issue 3: pp.510-521.
[6]
Koliadis G, Ghose A. Verifying semantic business process models in inter-operation. IEEE International Conference on Services Computing, Salt Lake City, Utah, USA, 2007; pp.731-738.
[7]
Xiong P, Fan Y, Zhou M. A petri net approach to analysis and composition of web services. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans 2010; Volume 40 Issue 2: pp.376-387.
[8]
Liu G, Jiang C, Zhou M. Process nets with channels. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans 2011; Volume 42 Issue 1: pp.213-225.
[9]
Ibáñez MJ, Fabra J, Alvarez P, Ezpeleta J. Model checking analysis of semantically annotated business processes. IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans 2012; Volume 42 Issue 4: pp.854-867.
[10]
González-López¿de Murillas E, Fabra J, Alvarez P, Ezpeleta J. Combas: a semantic-based model checking framework. ADVCOMP 2012, the Sixth International Conference on Advanced Engineering Computing and Applications in Sciences, Barcelona, Spain, 2012; pp.46-52.
[11]
Valmari A. Stubborn sets for reduced state space generation. Advances in Petri Nets 1991; Volume 483: pp.491-515.
[12]
Haddad S, Ilié J, Taghelit M, Zouari B. Symbolic reachability graph and partial symmetries. In Application and Theory of Petri Nets 1995, vol.¿Volume 935, <bookSeriesTitle>Lecture Notes in Computer Science</bookSeriesTitle>. Springer, Berlin Heidelberg, 1995; pp.238-257.
[13]
Bryant RE. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys CSUR 1992; Volume 24 Issue 3: pp.293-318.
[14]
Pastor E, Roig O, Cortadella J, Badia RM. Petri net analysis using boolean manipulation. Proceedings of the 15th International Conference on Application and Theory of Petri Nets. Springer-Verlag, Heidelberg, 1994; pp.416-435.
[15]
Miner A, Ciardo G. Efficient reachability set generation and storage using decision diagrams. In Application and Theory of Petri Nets, vol.¿Volume 1639, <bookSeriesTitle>Lecture Notes in Computer Science</bookSeriesTitle>. Springer, Berlin Heidelberg; pp.6-25, 1999.
[16]
Barbuti R, De¿Francesco N, Santone A, Vaglini G. Loreto: a tool for reducing state explosion in verification of lotos programs. Software: Practice and Experience 1999; Volume 29 Issue 12: pp.1123-1147.
[17]
Finkel A. The minimal coverability graph for petri nets. 12th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets. Springer-Verlag, 1993; pp.210-243.
[18]
Wang S, Zhou M, Li Z, Wang C. A new modified reachability tree approach and its applications to unbounded petri nets. IEEE Transaction Systems, Man, and Cybernetics: Systems 2013; Volume 43 Issue 4: pp.932-940.
[19]
Allmaier SC, Horton G. Parallel shared-memory state-space exploration in stochastic modeling. Solving Irregularly Structured Problems in Parallel. Springer, 1997; pp.207-218.
[20]
Allmaier SC, Kowarschik M, Horton G. State space construction and steady-state solution of GSPNs on a shared-memory multiprocessor. Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, IEEE, Saint Malo, France, 1997; pp.112-121.
[21]
Marenzoni P, Caselli S, Conte G. Analysis of large GSPN models: a distributed solution tool. Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, IEEE, Saint Malo, France, 1997; pp.122-131.
[22]
Friedman R, Goldin M, Itzkovitz A, Schuster A. Millipede: easy parallel programming in available distributed environments. Software: Practice and Experience 1997; Volume 27 Issue 8: pp.929-965.
[23]
Arunachlam P, Chase C, Moundanos D. Distributed binary decision diagrams for verification of large circuits. IEEE International Conference on Computer Design: VLSI in Computers and Processors, Austin, Texas, 1996; pp.365-370.
[24]
<familyNamePrefix>van</familyNamePrefix>Dijk T, Laarman A, van¿de Pol J. Multi-core BDD operations for symbolic reachability. Electronic Notes in Theoretical Computer Science 2013; Volume 296: pp.127-143.
[25]
Barrett C, Stump A, Tinelli C. The SMT-LIB standard: Version 2.0. Proceedings of the 8th International Workshop on Satisfiability Modulo Theories, vol.¿13, Edinburgh, Scotland, 2010; pp.pp.14.
[26]
van¿der Aalst WMP. The application of Petri nets to workflow management. The Journal of Circuits, Systems and Computers 1998; Volume 8 Issue 1: pp.21-66.
[27]
Guan Z, Hernandez F, Bangalore P, Gray J, Skjellum A, Velusamy V, Liu Y. Grid-flow: a grid-enabled scientific workflow system with a Petri-net-based interface: Research articles. Concurrency and Computation: Practice and Experience 2006; Volume 18: pp.1115-1140.
[28]
van¿der Aalst WMP, Hee K. Workflow Management: Models, Methods, and Systems. MIT Press, Cambridge, MA, USA, 2002.
[29]
<familyNamePrefix>ter</familyNamePrefix>Horst HJ. Completeness, decidability and complexity of entailment for RDF schema and a semantic extension involving the OWL vocabulary. Web Semantics: Science, Services and Agents on the World Wide Web 2005; Volume 3 Issue 23: pp.79-115.
[30]
Kordon F, Linard A, Paviot-Adet E. Optimized Colored Nets Unfolding. Springer, Berlin Heidelberg, 2006; pp.339-355.
[31]
Hayes P. RDF Semantics. Techical Report. W3C Recommendation, 2004. "http://www.w3.org/TR/rdf-mt/".
[32]
Richardson L, Ruby S. RESTful Web Services. O'Reilly Media, Inc., 2008.
[33]
Barrett C, Tinelli C. Cvc3. Computer Aided Verification. Springer, Berlin, Germany, 2007; pp.298-302.
[34]
Google CP. "https://cloud.google.com" {Accessed on August, 2016}.
[35]
Moreau L, Ludäscher B, Altintas I, Barga RS, Bowers S, Callahan S,. et al. Special issue: the first provenance challenge. Concurrency and Computation: Practice and Experience 2008; Volume 20: pp.409-418.
[36]
Litzkow M, Tannenbaum T, Basney J, Livny M. Checkpoint and Migration of Unix Processes in the Condor Distributed Processing System. Computer Sciences Department, University of Wisconsin, Wisconsin-Madison, USA, 1997.
[37]
Ansel J, Arya K, Cooperman G. DMTCP: transparent checkpointing for cluster computations and the desktop. IEEE International Symposium on Parallel and Distributed Processing, Chengdu, China, 2009; pp.1-12.
[38]
Wang F, Xin Q, Hong B, Brandt SA, Miller EL, Long DD, McLarty TT. File system workload analysis for large scale scientific computing applications. Proceedings of the 21st IEEE/12th NASA Goddard Conference on mass Storage Systems and Technologies, College Park, MD, USA, 2004; pp.139-152.
[39]
Google Cloud SDK. "https://cloud.google.com/sdk/" {Accessed on August, 2016}.
[40]
Amazon Elastic Computing Cloud Amazon EC2. "http://aws.amazon.com/ec2/" {Accessed on August, 2016}.
[41]
Dean J, Ghemawat S. Mapreduce: simplified data processing on large clusters. Communications of the ACM 2008; Volume 51 Issue 1: pp.107-113.
[42]
Huber P, Jensen AM, Li, Jepsen LO, Jensen K. Reachability trees for high-level Petri nets. Theoretical Computer Science September 1986; Volume 45 Issue 3: pp.261-292.
Index Terms
- Parallel computation of the reachability graph of petri net models with semantic information
Index terms have been assigned to the content through auto-classification.
Recommendations
A Sufficient Condition for Reachability in a General Petri Net
Necessary and sufficient conditions for reachability exist only for special classes of Petri nets, acyclic Petri nets being one among them. We present a net transformation procedure that converts a general Petri net into an acyclic Petri net to utilize ...
Interoperable Petri net models via ontology
The paper presents a Petri net infrastructure that should allow sharing Petri nets on the Semantic Web. Previous solutions only provide model interchange mechanisms between Petri net tools. The Petri net ontology is a central part of our solution. The ...
Petri net ontology
The paper presents the Petri net ontology that enables sharing Petri nets on the Semantic Web. Previous work on formal methods for representing Petri nets mainly defines tool-specific descriptions or formats for model interchange. However, such efforts ...
Comments
Information & Contributors
Information
Published In
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Published: 01 May 2017
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in