Skip to main content

Compositional Analysis of Probabilistic Timed Graph Transformation Systems

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 12649)

Abstract

The analysis of behavioral models is of high importance for cyber-physical systems, as the systems often encompass complex behavior based on e.g. concurrent components with mutual exclusion or probabilistic failures on demand. The rule-based formalism of probabilistic timed graph transformation systems is a suitable choice when the models representing states of the system can be understood as graphs and timed and probabilistic behavior is important. However, model checking PTGTSs is limited to systems with rather small state spaces.

We present an approach for the analysis of large-scale systems modeled as probabilistic timed graph transformation systems by systematically decomposing their state spaces into manageable fragments. To obtain qualitative and quantitative analysis results for a large-scale system, we verify that results obtained for its fragments serve as overapproximations for the corresponding results of the large-scale system. Hence, our approach allows for the detection of violations of qualitative and quantitative safety properties for the large-scale system under analysis. We consider a running example in which we model shuttles driving on tracks of a large-scale topology and for which we verify that shuttles never collide and are unlikely to execute emergency brakes. In our evaluation, we apply an implementation of our approach to the running example.

Keywords

  • cyber-physical systems
  • graph transformation systems
  • qualitative analysis
  • quantitative analysis
  • probabilistic timed systems
  • compositional analysis
  • model checking

Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - 241885098, 148420506.

References

  1. Paolo Baldan, Andrea Corradini, and Barbara König. “Static Analysis of Distributed Systems with Mobility Specified by Graph Grammars—A Case Study”. In: Proc. of Int. Conf. on Integrated Design & Process Technology. Ed. by Ehrig, Krämer, et al. SDPS, 2002.

    Google Scholar 

  2. Basil Becker. “Architectural modelling and verification of open service-oriented systems of systems”. PhD thesis. Hasso-Plattner-Institut für Softwaresystemtechnik, Universität Potsdam, 2014. url: http://opus.kobv.de/ubp/volltexte/2014/7015/.

  3. Basil Becker, Dirk Beyer, Holger Giese, Florian Klein, and Daniela Schilling. “Symbolic invariant verification for systems with dynamic structural adaptation”. In: 28th International Conference on Software Engineering (ICSE 2006), Shanghai, China, May 20-28, 2006. Ed. by Leon J. Osterweil, H. Dieter Rombach, and Mary Lou Soffa. ACM, 2006, pp. 72–81. doihttps://doi.org/10.1145/1134285.1134297.

  4. Basil Becker and Holger Giese. “On Safe Service-Oriented Real-Time Coordination for Autonomous Vehicles”. In: 11th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2008), 5-7 May 2008, Orlando, Florida, USA. IEEE Computer Society, 2008, pp. 203–210. doihttps://doi.org/10.1109/ISORC.2008.13.

  5. Basil Becker, Holger Giese, and Stefan Neumann. Correct dynamic service-oriented architectures : modeling and compositional verification with dynamic collaborations. Tech. rep. 29. Hasso Plattner Institute at the University of Potsdam, 2009.

    Google Scholar 

  6. Frank Drewes, Berthold Hoffmann, and Mark Minas. “Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement”. In: J. Log. Algebraic Methods Program. 104 (2019), pp. 303–341. doihttps://doi.org/10.1016/j.jlamp.2018.12.006.

  7. Frank Drewes, Berthold Hoffmann, and Mark Minas. “Graph Parsing as Graph Transformation - Correctness of Predictive Top-Down Parsers”. In: Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25-26, 2020, Proceedings. Ed. by Fabio Gadducci and Timo Kehrer. Vol. 12150. Lecture Notes in Computer Science. Springer, 2020, pp. 221–238. doihttps://doi.org/10.1007/978-3-030-51372-6_13.

  8. Frank Drewes, Berthold Hoffmann, and Mark Minas. “Predictive Top-Down Parsing for Hyperedge Replacement Grammars”. In: Graph Transformation - 8th International Conference, ICGT 2015, Held as Part of STAF 2015, L’Aquila, Italy, July 21-23, 2015. Proceedings. Ed. by Francesco Parisi- Presicce and Bernhard Westfechtel. Vol. 9151. Lecture Notes in Computer Science. Springer, 2015, pp. 19–34. doihttps://doi.org/10.1007/978-3-319-21145-9_2.

  9. Johannes Dyck. “Verification of Graph Transformation Systems with k-Inductive Invariants”. PhD thesis. University of Potsdam, Hasso Plattner Institute, Potsdam, Germany, 2020. doihttps://doi.org/10.25932/publishup-44274.

  10. Hartmut Ehrig, Karsten Ehrig, Ulrike Prange, and Gabriele Taentzer. Fundamentals of Algebraic Graph Transformation. Springer-Verlag, 2006.

    Google Scholar 

  11. Amir Hossein Ghamarian and Arend Rensink. “Generalised Compositionality in Graph Transformation”. In: Graph Transformations - 6th International Conference, ICGT 2012, Bremen, Germany, September 24-29, 2012. Proceedings. Ed. by Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski, and Grzegorz Rozenberg. Vol. 7562. Lecture Notes in Computer Science. Springer, 2012, pp. 234–248. doihttps://doi.org/10.1007/978-3-642-33654-6_16.

  12. Holger Giese. “‘Modeling and Verification of Cooperative Self-adaptive Mechatronic Systems”. In: Reliable Systems on Unreliable Networked Platforms - 12th Monterey Workshop 2005, Laguna Beach, CA, USA, September 22-24, 2005. Revised Selected Papers. Ed. by Fabrice Kordon and Janos Sztipanovits. Vol. 4322. Lecture Notes in Computer Science. Springer, 2005, pp. 258–280. doihttps://doi.org/10.1007/978-3-540-71156-8_14.

  13. Holger Giese and Wilhelm Schäfer. “Model-Driven Development of Safe Self-optimizing Mechatronic Systems with MechatronicUML”. In: Assurances for Self-Adaptive Systems - Principles, Models, and Techniques. Ed. by Javier Cámara, Rogério de Lemos, Carlo Ghezzi, and Antónia Lopes. Vol. 7740. Lecture Notes in Computer Science. Springer, 2013, pp. 152–186. doihttps://doi.org/10.1007/978-3-642-36249-1_6.

  14. Holger Giese, Matthias Tichy, Sven Burmester, and Stephan Flake. “Towards the compositional verification of real-time UML designs”. In: Proceedings of the 11th ACM SIGSOFT Symposium on Foundations of Software Engineering 2003 held jointly with 9th European Software Engineering Conference, ESEC/FSE 2003, Helsinki, Finland, September 1-5, 2003. Ed. by Jukka Paakki and Paola Inverardi. ACM, 2003, pp. 38–47. doihttps://doi.org/10.1145/940071.940078.

  15. Eun-Young Kang, Dongrui Mu, and Li Huang. “Probabilistic Verification of Timing Constraints in Automotive Systems Using UPPAAL-SMC”. In: Integrated Formal Methods - 14th International Conference, IFM 2018, Maynooth, Ireland, September 5-7, 2018, Proceedings. Ed. by Carlo A. Furia and Kirsten Winter. Vol. 11023. Lecture Notes in Computer Science. Springer, 2018, pp. 236–254. doihttps://doi.org/10.1007/978-3-319-98938-9_14.

  16. Marta Z. Kwiatkowska, Gethin Norman, and David Parker. “PRISM 4.0: Verification of Probabilistic Real-Time Systems”. In: Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, July 14-20, 2011. Proceedings. Ed. by Ganesh Gopalakrishnan and Shaz Qadeer. Vol. 6806. Lecture Notes in Computer Science. Springer, 2011, pp. 585–591. isbn: 978-3-642-22109-5. doihttps://doi.org/10.1007/978-3-642-22110-1_47.

  17. Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston, and Fuzhi Wang. “Symbolic Model Checking for Probabilistic Timed Automata”. In: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems, Joint International Conferences on Formal Modelling and Analysis of Timed Systems, FORMATS 2004 and Formal Techniques in Real-Time and Fault-Tolerant Systems, FTRTFT 2004, Grenoble, France, September 22-24, 2004, Proceedings. Ed. by Yassine Lakhnech and Sergio Yovine. Vol. 3253. Lecture Notes in Computer Science. Springer, 2004, p. 293–308. isbn: 3-540-23167-6. doihttps://doi.org/10.1007/978-3-540-30206-3_21.

  18. Maria Maximova, Holger Giese, and Christian Krause. “Probabilistic timed graph transformation systems”. In: Graph Transformation - 10th International Conference, ICGT 2017, Held as Part of STAF 2017, Marburg, Germany, July 18-19, 2017, Proceedings. Ed. by Juan de Lara and Detlef Plump. Vol. 10373. Lecture Notes in Computer Science. Springer, 2017, pp. 159–175. isbn: 978-3-319-61469-4. doihttps://doi.org/10.1007/978-3-319-61470-0_10.

  19. Maria Maximova, Holger Giese, and Christian Krause. “Probabilistic timed graph transformation systems”. In: J. Log. Algebr. Meth. Program. 101 (2018), pp. 110–131. doihttps://doi.org/10.1016/j.jlamp.2018.09.003.

  20. Maria Maximova, Sven Schneider, and Holger Giese. Compositional Analysis of Probabilistic Timed Graph Transformation Systems. Tech. rep. 133. Potsdam, Germany: Hasso Plattner Institute at the University of Potsdam, 2021.

    Google Scholar 

  21. Fernando Orejas. “Symbolic graphs for attributed graph constraints”. In: J. Symb. Comput. 46.3 (2011), pp. 294–315. doihttps://doi.org/10.1016/j.jsc.2010.09.009.

  22. Fernando Orejas and Leen Lambers. “Lazy Graph Transformation”. In: Fundam. Inform. 118.1-2 (2012), pp. 65–96. doihttps://doi.org/10.3233/FI-2012-706.

  23. RailCab Project. url: https://www.hni.uni-paderborn.de/cim/projekte/railcab.

  24. Arend Rensink. “Compositionality in Graph Transformation”. In: Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, July 6-10, Bordeaux, France, 2010, Proceedings, Part II. Ed. by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis. Vol. 6199. Lecture Notes in Computer Science. Springer, 2010, pp. 309–320. doihttps://doi.org/10.1007/978-3-642-14162-1_26.

  25. Willem P. de Roever, Hans Langmaack, and Amir Pnueli, eds. Compositionality: The Significant Difference, International Symposium, COMPOS’97, Bad Malente, Germany, September 8-12, 1997. Revised Lectures. Vol. 1536. Lecture Notes in Computer Science. Springer, 1998. isbn: 3-540-65493-3. doihttps://doi.org/10.1007/3-540-49213-5.

  26. Sven Schneider, Johannes Dyck, and Holger Giese. “Formal Verification of Invariants for Attributed Graph Transformation Systems Based on Nested Attributed Graph Conditions”. In: Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25-26, 2020, Proceedings. Ed. by Fabio Gadducci and Timo Kehrer. Vol. 12150. Lecture Notes in Computer Science. Springer, 2020, pp. 257–275. doihttps://doi.org/10.1007/978-3-030-51372-6_15.

  27. Sven Schneider, Leen Lambers, and Fernando Orejas. “Automated reasoning for attributed graph properties”. In: STTT 20.6 (2018), pp. 705–737. doihttps://doi.org/10.1007/s10009-018-0496-3.

  28. Sven Schneider, Maria Maximova, Lucas Sakizloglou, and Holger Giese. “Formal Testing of Timed Graph Transformation Systems using Metric Temporal Graph Logic”. In: STTT (2019). Accepted.

    Google Scholar 

  29. Sven Schneider, Lucas Sakizloglou, Maria Maximova, and Holger Giese. “Optimistic and Pessimistic On-the-fly Analysis for Metric Temporal Graph Logic”. In: Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25-26, 2020, Proceedings. Ed. by Fabio Gadducci and Timo Kehrer. Vol. 12150. Lecture Notes in Computer Science. Springer, 2020, pp. 276–294. doihttps://doi.org/10.1007/978-3-030-51372-6_16.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Maximova .

Editor information

Editors and Affiliations

Rights and permissions

Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Reprints and Permissions

Copyright information

© 2021 The Author(s)

About this paper

Verify currency and authenticity via CrossMark

Cite this paper

Maximova, M., Schneider, S., Giese, H. (2021). Compositional Analysis of Probabilistic Timed Graph Transformation Systems. In: Guerra, E., Stoelinga, M. (eds) Fundamental Approaches to Software Engineering. FASE 2021. Lecture Notes in Computer Science(), vol 12649. Springer, Cham. https://doi.org/10.1007/978-3-030-71500-7_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-71500-7_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-71499-4

  • Online ISBN: 978-3-030-71500-7

  • eBook Packages: Computer ScienceComputer Science (R0)