Publisher
Springer Nature Switzerland
Reference21 articles.
1. Balasubramanian, D., Narayanan, A., Buskirk, C., Karsai, G.: The graph rewriting and transformation language: GReAT. Electronic Communications of the EASST 1 (2006). https://doi.org/10.14279/tuj.eceasst.1.89
2. Blau, H., Immerman, N., Jensen, D.: A visual language for querying and updating graphs. Tech. rep., University of Massachusetts (2002), https://web.cs.umass.edu/publication/docs/2002/UM-CS-2002-037.pdf
3. Brus, T.H., van Eekelen, M.C.J.D., van Leer, M.O., Plasmeijer, M.J.: Clean — a language for functional graph rewriting. In: Functional Programming Languages and Computer Architecture (FPCA 1987). LNCS, vol. 274, pp. 364–384. Springer Berlin Heidelberg (1987)https://doi.org/10.1007/3-540-18317-5_20
4. Desel, J., Reisig, W.: Place/transition Petri nets. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models: Advances in Petri Nets, pp. 122–173. Springer Berlin Heidelberg (1998) https://doi.org/10.1007/3-540-65306-6_15
5. Fan, W., Wu, Y., Xu, J.: Adding counting quantifiers to graph patterns. In: Proc. SIGMOD’16. pp. 1215–1230. ACM, New York, NY, USA (2016)https://doi.org/10.1145/2882903.2882937