%0 Book Section %1 bellettini2013mardigras %A Bellettini, Carlo %A Camilli, Matteo %A Capra, Lorenzo %A Monga, Mattia %B Reachability Problems %D 2013 %E Abdulla, ParoshAziz %E Potapov, Igor %I Springer Berlin Heidelberg %K analysis cloud mapreduce petrinet %P 83-95 %R 10.1007/978-3-642-41036-9_9 %T MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters %U http://dx.doi.org/10.1007/978-3-642-41036-9_9 %V 8169 %X 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 pro- gramming interface, it can be easily customized to different formalisms, for example Petri Nets, by either adapting legacy tools or implement- ing brand new distributed reachability graph builders. The outcome of several tests performed on benchmark specifications are presented. %@ 978-3-642-41035-2

@incollection{bellettini2013mardigras, 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 pro- gramming interface, it can be easily customized to different formalisms, for example Petri Nets, by either adapting legacy tools or implement- ing brand new distributed reachability graph builders. The outcome of several tests performed on benchmark specifications are presented.}, added-at = {2014-10-11T19:01:36.000+0200}, author = {Bellettini, Carlo and Camilli, Matteo and Capra, Lorenzo and Monga, Mattia}, biburl = {https://www.bibsonomy.org/bibtex/2d2d1e9d2a0eb9eedb0e42c02ef340731/carlobellettini}, booktitle = {Reachability Problems}, doi = {10.1007/978-3-642-41036-9_9}, editor = {Abdulla, ParoshAziz and Potapov, Igor}, interhash = {92896be7ca2f6bcee7ab4732d11322ad}, intrahash = {d2d1e9d2a0eb9eedb0e42c02ef340731}, isbn = {978-3-642-41035-2}, keywords = {analysis cloud mapreduce petrinet}, language = {English}, pages = {83-95}, publisher = {Springer Berlin Heidelberg}, series = {Lecture Notes in Computer Science}, timestamp = {2014-10-14T13:38:57.000+0200}, title = {MaRDiGraS: Simplified Building of Reachability Graphs on Large Clusters}, url = {http://dx.doi.org/10.1007/978-3-642-41036-9_9}, volume = 8169, year = 2013 }