Abstract
Dealing with complex systems often needs the building of huge reachability graphs, thus revealing all the challenges associated with big data access and management. It also requires high performance data processing tools that would allow scientists to extract the knowledge from the unprecedented amount of data coming from these analyzed systems. In this paper we present MaRDiGraS, a generic framework aimed at simplifying the construction of very large state transition systems on large clusters and cloud computing platforms. Through a simple programming interface, it can be easily customized to different formalisms, for example Petri Nets, by either adapting legacy tools or implementing brand new distributed reachability graph builders. The outcome of several tests performed on benchmark specifications are presented.
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
Amazon Web Services. AWS in Education, http://aws.amazon.com/grants/
Amazon Web Services. Elastic MapReduce, http://aws.amazon.com/-documentation/elasticmapreduce/
Bellettini, C., Camilli, M., Capra, L., Monga, M.: Symbolic state space exploration of RT systems in the cloud. In: Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2012, pp. 295–302. IEEE CS Press, Los Alamitos (2012)
Bellettini, C., Capra, L.: Reachability analysis of time basic Petri nets: a time coverage approach. In: Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2011, pp. 110–117. IEEE CS Press, Los Alamitos (2011)
Berthomieu, B., Diaz, M.: Modeling and verification of time dependent systems using time Petri nets. IEEE Trans. Softw. Eng. 17, 259–273 (1991)
Boucheneb, H., Hadjidj, R.: CTL* model checking for time Petri nets. Theor. Comput. Sci. 353(1), 208–227 (2006)
Boukala, M.C., Petrucci, L.: Distributed model-checking and counterexample search for CTL logic. Int. J. Crit. Comput.-Based Syst. 3(1/2), 44–59 (2012)
Caselli, S., Conte, G., Marenzoni, P.: Parallel state space exploration for GSPN models. In: DeMichelis, G., Díaz, M. (eds.) ICATPN 1995. LNCS, vol. 935, pp. 181–200. Springer, Heidelberg (1995)
Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A symbolic reachability graph for coloured Petri nets. Theor. Comput. Sci. 176(1-2), 39–65 (1997)
Chiola, G., Franceschinis, G.: Colored GSPN models and automatic symmetry detection. In: Petri Nets and Performance Models, PNPM 1989, pp. 50–60 (1989)
Chiola, G., Franceschinis, G., Gaeta, R., Ribaudo, M.: Greatspn 1.7: GRaphical Editor and Analyzer for Timed and Stochastic Petri Nets. Performance Evaluation 24, 47–68 (1995)
Ciardo, G.: Automated parallelization of discrete state-space generation. J. Parallel Distrib. Comput. 47(2), 153–167 (1997)
Ciardo, G., Gluckman, J., Nicol, D.: Distributed state space generation of discrete-state stochastic models. INFORMS J. on Comp. 10(1), 82–93 (1998)
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51, 107–113 (2008)
Dingle, N.J., Knottenbelt, W.J., Suto, T.: Pipe2: a tool for the performance evaluation of generalised stochastic Petri nets. SIGMETRICS Perform. Eval. Rev. 36(4), 34–39 (2009)
Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., Fox, G.: Twister: a runtime for iterative MapReduce. In: Proc. of Symp. on High Performance Distributed Computing, pp. 810–818 (2010)
Ghezzi, C., Mandrioli, D., Morasca, S., Pezzè, M.: A unified high-level petri net formalism for time-critical systems. IEEE Trans. Softw. Eng. 17(2), 160–172 (1991)
Jensen, K., Rozenberg, G.: High-level Petri nets: theory and application. Springer (1991)
Kordon, F., Linard, A., Buchs, D., Colange, M., Evangelista, S., Fronc, L., Hillah, L.-M., Lohmann, N., Paviot-Adet, E., Pommereau, F., Rohr, C., Thierry-Mieg, Y., Wimmel, H., Wolf, K.: Raw report on the model checking contest at Petri nets 2012. CoRR, abs/1209.2382 (2012)
Kristensen, L., Petrucci, L.: An Approach to Distributed State Space Exploration for Coloured Petri Nets. In: 25th International Conference on Application and Theory of Petri Nets, Bologna, Italy (2004)
Lin, J.: Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce. In: Research and Development in Information Retrieval, SIGIR 2009, pp. 155–162. ACM (2009)
Lin, J., Schatz, M.: Design patterns for efficient graph algorithms in mapreduce. In: Mining and Learning with Graphs, pp. 78–85. ACM Press, New York (2010)
The Apache Software Foundation. Hadoop MapReduce, http://hadoop.apache.org/mapreduce/
Valmari, A.: The state explosion problem. In: Reisig, W., Rozenberg, G. (eds.) APN 1998. LNCS, vol. 1491, pp. 429–528. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bellettini, C., Camilli, M., Capra, L., Monga, M. (2013). MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters. In: Abdulla, P.A., Potapov, I. (eds) Reachability Problems. RP 2013. Lecture Notes in Computer Science, vol 8169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41036-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-41036-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41035-2
Online ISBN: 978-3-642-41036-9
eBook Packages: Computer ScienceComputer Science (R0)