Incremental pattern matching in graph-based state space exploration

Electronic Communications of the EASST

Volumn 32, Issue , 2010, Pages

  Ghamarian, Amir Hossein ^a   Jalali, Arash ^b   Rensink, Arend ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b NetStairscom   (United States)

Author keywords

Graph transformation; Incremental pattern matching; State space exploration

Indexed keywords

EID: 84907067076     PISSN: None     EISSN: 18632122     Source Type: Journal    
DOI: 10.14279/tuj.eceasst.32.520.542     Document Type: Conference Paper

References (13)

1. H. Bunke, T. Glauser, T.-H. Tran. An Efficient Implementation of Graph Grammars Based on the RETE Matching Algorithm. In Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science. Pp. 174-189. Springer-Verlag, London, UK, 1991
2. G. Bergmann, A. Ökrös, I. Ráth, D. Varró, G. Varró. Incremental pattern matching in the VIATRA model transformation system. In GRaMoT '08: Proceedings of the third international workshop on Graph and model transformations. Pp. 25-32. ACM, NY, USA, 2008
3. C. Forgy. RETE, a fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence 19:17-37, 1982
4. The FUJABA Toolsuite. 2006. Homepage: http://www.fujaba.de
5. R. Geiß, G. V. Batz, D. Grund, S. Hack, A. Szalkowski. GRGEN: A Fast SPO-Based Graph Rewriting Tool. In Corradini et al. (eds.), International Conference on Graph Transformations (ICGT). LNCS 4178, pp. 383-397. Springer, 2006
6. Z. Hanzálek. Petri Net Models for Manufacturing Systems. In Zalewski (ed.), Proc of the IEEE Workshop on Real-Time Systems Education, Daytona Beach. Pp. 99-105. IEEE Computer Society Press, Los Alamitos, Calif., 1996
7. Á. Horváth, G. Varró, D. Varró. Generic Search Plans forMatching Advanced Graph Patterns. ECEASST 6, 2007
8. B. König, V. Kozioura. Augur 2-A New Version of a Tool for the Analysis of Graph Transformation Systems. In Bruni and Varró (eds.), Graph Transformation and Visual Modeling Techniques (GT-VMT 2006). Electronic Notes in Theoretical Computer Science 211, pp. 201-210. 2008
9. A. Rensink. Representing First-Order Logic Using Graphs. In Ehrig et al. (eds.), International Conference on Graph Transformations (ICGT). LNCS 3256, pp. 319-335. Springer Verlag, 2004
10. A. Rensink. The GROOVE Simulator: A Tool for State Space Generation. In Pfaltz et al. (eds.), Applications of Graph Transformations with Industrial Relevance, (AGTIVE). LNCS 3062, pp. 479-485. Springer, 2004. See http://sourceforge.net/projects/groove
11. A. Rensink, J.-H. Kuperus. Repotting the geraniums: on nested graph transformation rules. In Boronat and Heckel (eds.), Graph transformation and visual modelling techniques (GTVMT). Electronic Communications of the EASST 18. EASST, 2009
12. G. Taentzer,M. Beyer. Amalgamated graph transformations and their use for specifying AGG an algebraic graph grammar system. In Schneider and Ehrig (eds.), Graph Transformations in Computer Science. Lecture Notes in Computer Science 776, pp. 380-394. Springer Berlin/Heidelberg, 1994
13. D. Varró, A. Balogh. The model transformation language of the VIATRA2 framework. Science of Computer Programming 68(3):187-207, 2007