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.
MaRDiGraS : simplified building of reachability graphs on large clusters / C. Bellettini, M. Camilli, L. Capra, M. Monga - In: Reachability problems : 7th International workshop, RP 2013 : Uppsala, Sweden, september 24-26, 2013 : proceedings / [a cura di] P.A. Abdulla, I. Potapov. - Berlin : Springer, 2013. - ISBN 9783642410352. - pp. 83-95 (( Intervento presentato al 7. convegno Reachability Problems tenutosi a Uppsala nel 2013.
|Titolo:||MaRDiGraS : simplified building of reachability graphs on large clusters|
BELLETTINI, CARLO NICOLA MARIA (Primo)
CAMILLI, MATTEO (Secondo)
CAPRA, LORENZO (Penultimo)
MONGA, MATTIA (Ultimo)
|Parole Chiave:||Big Data; Cloud Computing; Distributed Computing; Formal Methods; MapReduce; Reachability Graph|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2013|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1007/978-3-642-41036-9_9|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|