Symbolic State Space Exploration of RT Systems in the Cloud

The growing availability of distributed and cloud computing frameworks makes it possible to face complex computational problems in a more effective and convenient way. A notable example is state-space exploration of discrete-event systems specified in a formal way. The exponential complexity of this task is a major limitation to the usage of consolidated analysis techniques and tools. Several techniques for addressing the state space explosion problem within this context have been studied in the literature. One of these is to use distributed memory and computation to deal with the state space explosion problem. In this paper we study and compare two different approaches, relying on distributed and cloud frameworks, respectively. These approaches were designed and implemented following the same computational schema, a sort of map & fold. They are applied on symbolic state-space exploration of real-time systems specified by (a timed extension of) Petri Nets, by re-adapting a sequential algorithm implemented as a command-line Java tool. The outcome of several tests performed on a benchmarking specification are presented, thus showing the convenience of distributed approaches.

[1]  Hanifa Boucheneb,et al.  CTL* model checking for time Petri nets , 2006, Theor. Comput. Sci..

[2]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[3]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[4]  Kirsten Mark Hansen,et al.  Specifying and verifying requirements of real-time systems , 1991, SIGSOFT '91.

[5]  Radu Mateescu,et al.  Parallel state space construction for model-checking , 2001, SPIN '01.

[6]  M. Felder,et al.  A Tool For Analysing High-Level Timed Petri Nets , 1993 .

[7]  Ken Arnold,et al.  JavaSpaces¿ Principles, Patterns, and Practice , 1999 .

[8]  Geoffrey C. Fox,et al.  Twister: a runtime for iterative MapReduce , 2010, HPDC '10.

[9]  Laure Petrucci,et al.  An Approach to Distributed State Space Exploration for Coloured Petri Nets , 2004, ICATPN.

[10]  Dino Mandrioli,et al.  Modeling time in computing: A taxonomy and a comparative survey , 2008, CSUR.

[11]  Carlo Ghezzi,et al.  A Unified High-Level Petri Net Formalism for Time-Critical Systems , 1991, IEEE Trans. Software Eng..

[12]  Laure Petrucci,et al.  Modular state space exploration for timed petri nets , 2007, International Journal on Software Tools for Technology Transfer.

[13]  Antti Valmari,et al.  The State Explosion Problem , 1996, Petri Nets.

[14]  Carlo Bellettini,et al.  Reachability Analysis of Time Basic Petri Nets: A Time Coverage Approach , 2011, 2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[15]  Nicholas Carriero,et al.  Coordination languages and their significance , 1992, CACM.

[16]  Anders P. Ravn,et al.  Specifying and Verifying Requirements of Real-Time Systems , 1993, IEEE Trans. Software Eng..