Abstract
Simulation of stochastic graph transformation systems (SGTS) allows us to analyse the model’s behaviour. However, complexity of models limits our capability for analysis. In this paper, we aim to simplify models by abstraction while preserving relevant trends in their global behaviour. Based on a hierarchical graph model inspired by membrane systems, structural abstraction is achieved by “zooming out” of membranes, hiding their internal state. We use Bayesian networks representing dependencies on stochastic (input) parameters, as well as causal relationships between rules, for parameter learning and inference. We demonstrate and evaluate this process via two case studies, immunological response to a viral attack and reconfiguration in P2P networks.
Chapter PDF
Similar content being viewed by others
References
Bayes server, intelligent systems specialists, http://www.bayesserver.com/ (retrieved December 9, 2012)
Arijo, N., Heckel, R.: View-based modelling and state-space generation for graph transformation systems. ECEASST 47 (2012)
Bapodra, M., Heckel, R.: Case study - hypothetical immunological response rules (December 2012), http://www.cs.le.ac.uk/people/mb294/docs/CaseStudyRules_v3.pdf
Bapodra, M., Heckel, R.: Case study - VoIP rules (October 2012), http://www.cs.le.ac.uk/people/mb294/docs/VoIPCaseStudyRules.pdf
Bauer, J., Boneva, I., Kurbán, M., Rensink, A.: A modal-logic based graph abstraction. Graph Transformations, 321–335 (2008)
Iancu, B., Czeizler, E., Czeizler, E., Petre, I.: Quantitative refinement of reaction models. To appear: International Journal of Unconventional Computing
Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Abstracting the differential semantics of rule-based models: exact and automated model reduction. In: 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 362–381. IEEE (2010)
De Maesschalck, R., Jouan-Rimbaud, D., Massart, D.: The Mahalanobis distance. Chemometrics and Intelligent Laboratory Systems 50(1), 1–18 (2000)
Drewes, F., Hoffmann, B., Plump, D.: Hierarchical graph transformation. In: Foundations of Software Science and Computation Structures, pp. 98–113. Springer (2000)
Heckel, R., Lajios, G., Menge, S.: Stochastic graph transformation systems. Fundamenta Informaticae 74(1), 63–84 (2006)
Heckel, R., Corradini, A., Ehrig, H., Löwe, M.: Horizontal and vertical structuring of typed graph transformation systems. Mathematical Structures in Computer Science 6(6), 613–648 (1996)
Heckerman, D., et al.: A tutorial on learning with Bayesian networks. Nato Asi Series D Behavioural And Social Sciences 89, 301–354 (1998)
Joyal, A., Nielson, M., Winskel, G.: Bisimulation and open maps. In: Proceedings of Eighth Annual IEEE Symposium on Logic in Computer Science, LICS 1993, pp. 418–427. IEEE (1996)
Khan, A., Torrini, P., Heckel, R.: Model-based simulation of VoIP network reconfigurations using graph transformation systems. Electronic Communications of the EASST 16 (2009)
König, B., Kozioura, V.: Counterexample-Guided Abstraction Refinement for the Analysis of Graph Transformation Systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 197–211. Springer, Heidelberg (2006)
Löwe, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109, 181–224 (1993)
Oates, T., Doshi, S., Huang, F.: Estimating Maximum Likelihood Parameters for Stochastic Context-Free Graph Grammars. In: Horváth, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol. 2835, pp. 281–298. Springer, Heidelberg (2003)
Palacz, W.: Algebraic hierarchical graph transformation. Journal of Computer and System Sciences 68(3), 497–520 (2004)
Parisi-Presicce, F., Piersanti, G.: Multilevel graph grammars. In: Graph-Theoretic Concepts in Computer Science, pp. 51–64. Springer (1995)
Păun, G.: Introduction to membrane computing. Applications of Membrane Computing, 1–42 (2006)
Pourret, O., Nam, P., Naïm, P., Marcot, B., et al.: Bayesian networks: a practical guide to applications, vol. 73. Wiley (2008)
Rensink, A., Distefano, D.: Abstract graph transformation. Electronic Notes in Theoretical Computer Science 157(1), 39–59 (2006)
Sagiv, M., Reps, T., Wilhelm, R.: Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems (TOPLAS) 20(1), 1–50 (1998)
Torrini, P., Heckel, R., Ráth, I.: Stochastic simulation of graph transformation systems. Fundamental Approaches to Software Engineering, 154–157 (2010)
Yamamoto, M., Tanabe, Y., Takahashi, K., Hagiya, M.: Abstraction of Graph Transformation Systems by Temporal Logic and Its Verification. In: Meyer, B., Woodcock, J. (eds.) VSTTE 2005. LNCS, vol. 4171, pp. 518–527. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bapodra, M., Heckel, R. (2013). Abstraction and Training of Stochastic Graph Transformation Systems. In: Cortellessa, V., Varró, D. (eds) Fundamental Approaches to Software Engineering. FASE 2013. Lecture Notes in Computer Science, vol 7793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37057-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-37057-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37056-4
Online ISBN: 978-3-642-37057-1
eBook Packages: Computer ScienceComputer Science (R0)