Reachability Problems

In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors. We will concentrate on robustness against timing errors which can be due to measuring errors, imprecise clocks, and unexpected runtime behaviors such as execution times that are longer or shorter than expected. We consider the perturbation model of guard enlargement and formulate several robust verification problems that have been studied recently, including robustness analysis, robust implementation, and robust control.

[1]  Jimmy J. Lin,et al.  Design patterns for efficient graph algorithms in MapReduce , 2010, MLG '10.

[2]  Mattia Monga,et al.  Symbolic State Space Exploration of RT Systems in the Cloud , 2012, 2012 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing.

[3]  Jimmy J. Lin.  Brute force and indexed approaches to pairwise document similarity comparisons with MapReduce , 2009, SIGIR.

[4]  David M. Nicol,et al.  Distributed State Space Generation of Discrete-State Stochastic Models , 1995, INFORMS J. Comput..

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

[6]  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.

[7]  Grzegorz Rozenberg,et al.  High-level Petri Nets: Theory And Application , 1991 .

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

[9]  Fabrice Kordon,et al.  Raw Report on the Model Checking Contest at Petri Nets 2012 , 2012, ArXiv.

[10]  Giovanni Chiola,et al.  Colored GSPN models and automatic symmetry detection , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[11]  Nicholas J. Dingle,et al.  PIPE2: a tool for the performance evaluation of generalised stochastic Petri Nets , 2009, PERV.

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

[13]  G. Conte,et al.  Parallel State Space Exploration for GSPN Models , 1995, Application and Theory of Petri Nets.

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

[15]  Giovanni Chiola,et al.  A Symbolic Reachability Graph for Coloured Petri Nets , 1997, Theor. Comput. Sci..

[16]  Laure Petrucci,et al.  Distributed model-checking and counterexample search for CTL logic , 2012, Int. J. Crit. Comput. Based Syst..

[17]  Giovanni Chiola,et al.  GreatSPN 1.7: Graphical Editor and Analyzer for Timed and Stochastic Petri Nets , 1995, Perform. Evaluation.

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

[19]  David M. Nicol,et al.  Automated Parallelization of Discrete State-Space Generation , 1997, J. Parallel Distributed Comput..