References

  1. Franz Baader, Diego Calvanese, Deborah McGuinness, Peter Patel-Schneider & Daniele Nardi (2003): The Description Logic handbook: theory, implementation and applications. Cambridge University Press.
  2. Konstantinos Barmpis, Seyyed Shah & Dimitrios S. Kolovos (2015): Towards incremental updates in large-scale model indexes. In: Modelling Foundations and Applications (ECMFA). Springer, Cham, pp. 137–153, doi:10.1007/978-3-319-21151-0_10.
  3. Nicolas Behr (2019): Sesqui-pushout rewriting: concurrency, associativity and rule algebra framework. Electronic Proceedings in Theoretical Computer Science 309, pp. 23–52, doi:10.4204/eptcs.309.2.
  4. Angela Bonifati, Peter Furniss, Alastair Green, Russ Harmer, Eugenia Oshurko & Hannes Voigt (2019): Schema validation and evolution for graph databases. In: Conceptual Modeling (ER). Springer, Cham, pp. 448–456, doi:10.1007/978-3-030-33223-5_37.
  5. Arnaud Castelltort & Anne Laurent (2013): Representing history in graph-oriented NoSQL databases: a versioning system. In: Digital Information Management (ICDIM). IEEE, pp. 228–234, doi:10.1109/ICDIM.2013.6694022.
  6. Peter Pin-Shan Chen (1976): The entity-relationship model—toward a unified view of data. ACM Transactions on Database Systems (TODS) 1(1), pp. 9–36, doi:10.1145/320434.320440.
  7. Andrea Corradini, Tobias Heindel, Frank Hermann & Barbara König (2006): Sesqui-pushout rewriting. In: Graph Transformations (ICGT). Springer, Berlin, Heidelberg, pp. 30–45, doi:10.1007/11841883_4.
  8. Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel & Michael Löwe (1997): Algebraic approaches to graph transformation–part I: basic concepts and double pushout approach. In: Handbook Of Graph Grammars And Computing By Graph Transformation: Volume 1: Foundations. World Scientific, pp. 163–245, doi:10.1142/9789812384720_0003.
  9. Vincent Danos, Tobias Heindel, Ricardo Honorato-Zimmer & Sandro Stucki (2014): Reversible sesqui-pushout rewriting. In: Graph Transformation (ICGT). Springer, Cham, pp. 161–176, doi:10.1007/978-3-319-09108-2_11.
  10. Roy Dyckhoff & Walter Tholen (1987): Exponentiable morphisms, partial products and pullback complements. Journal of Pure and Applied Algebra 49(1-2), pp. 103–116, doi:10.1016/0022-4049(87)90124-1.
  11. Hartmut Ehrig, Claudia Ermel & Gabriele Taentzer (2011): A formal resolution strategy for operation-based conflicts in model versioning using graph modifications. In: Fundamental Approaches to Software Engineering (FASE). Springer, Berlin, Heidelberg, pp. 202–216, doi:10.1007/978-3-642-19811-3_15.
  12. Hartmut Ehrig, Annegret Habel, Hans-Jörg Kreowski & Francesco Parisi-Presicce (1991): Parallelism and concurrency in high-level replacement systems. Mathematical Structures in Computer Science 1(3), pp. 361–404, doi:10.1017/S0960129500001353.
  13. Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer & Andrés Taylor (2018): Cypher: An evolving query language for property graphs. In: Management of Data (SIGMOD). ACM, pp. 1433–1445, doi:10.1145/3183713.3190657.
  14. Russ Harmer (2017): Rule-based meta-modelling for bio-curation. Habilitation à Diriger des Recherches. ENS Lyon, France. Available at https://tel.archives-ouvertes.fr/tel-01534703/.
  15. Russ Harmer, Yves-Stan Le Cornec, Sébastien Légaré & Eugenia Oshurko (2019): Bio-curation for cellular signalling: the KAMI project. IEEE/ACM transactions on computational biology and bioinformatics 16(5), pp. 1562–1573, doi:10.1109/TCBB.2019.2906164.
  16. Russ Harmer & Eugenia Oshurko (2020): Knowledge representation and update in hierarchies of graphs. Journal of Logical and Algebraic Methods in Programming 114, 100559, doi:10.1016/j.jlamp.2020.100559.
  17. Udayan Khurana & Amol Deshpande (2013): Efficient snapshot retrieval over historical graph data. In: Data Engineering (ICDE). IEEE, pp. 997–1008, doi:10.1109/ICDE.2013.6544892.
  18. Stephen Lack & Pawel Sobocinski (2004): Adhesive categories. In: Foundations of Software Science and Computation Structures (FoSSaCS). Springer, Berlin, Heidelberg, pp. 273–288, doi:10.1007/978-3-540-24727-2_20.
  19. Stephen Lack & PawełSobociński (2005): Adhesive and quasiadhesive categories. RAIRO-Theoretical Informatics and Applications 39(3), pp. 511–545, doi:10.1051/ita:2005028.
  20. James J. Leifer & Robin Milner (2000): Deriving bisimulation congruences for reactive systems. In: Concurrency Theory (Concur). Springer, Berlin, Heidelberg, pp. 243–258, doi:10.1007/3-540-44618-4_19.
  21. Michael Löwe (2015): Polymorphic sesqui-pushout graph rewriting. In: Graph Transformation (ICGT). Springer, Cham, pp. 3–18, doi:10.1007/978-3-319-21145-9_1.
  22. Eugenia Oshurko (2020): Knowledge representation and curation in hierarchies of graphs. PhD thesis. Université de Lyon. Available at https://tel.archives-ouvertes.fr/tel-02917559.
  23. Betty Salzberg & Vassilis J. Tsotras (1999): Comparison of access methods for time-evolving data. ACM Computing Surveys (CSUR) 31(2), pp. 158–221, doi:10.1145/319806.319816.
  24. Christian Schneider, Albert Zündorf & Jörg Niere (2004): CoObRA–a small step for development tools to collaborative environments. In: Workshop on Directions in Software Engineering Environments (WoDiSEE). IET, doi:10.1049/ic:20040206.
  25. Gabriele Taentzer, Claudia Ermel, Philip Langer & Manuel Wimmer (2010): Conflict detection for model versioning based on graph modifications. In: Graph Transformation (ICGT). Springer, Berlin, Heidelberg, pp. 171–186, doi:10.1007/978-3-642-15928-2_12.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org