{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T02:51:08Z","timestamp":1767495068750,"version":"3.40.5"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Applied Categorical Structures"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1023\/a:1008734426504","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T16:37:32Z","timestamp":1040575052000},"page":"83-110","source":"Crossref","is-referenced-by-count":22,"title":["Double-Pullback Transitions and Coalgebraic Loose Semantics for Graph Transformation Systems"],"prefix":"10.1007","volume":"9","author":[{"given":"Reiko","family":"Heckel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Ehrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Wolter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"206848_CR1","unstructured":"Pfaltz, J. L. and Rosenfeld, A.: Web grammars, in Int. Joint Conference on Artificial Intelligence, 1969, pp. 609-619."},{"key":"206848_CR2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0019-9958(70)90135-X","volume":"16","author":"U. Montanari","year":"1970","unstructured":"Montanari, U.: Separable graphs, planar graphs and web grammars, Inform. and Control\n16 (1970), 243-267.","journal-title":"Inform. and Control"},{"key":"206848_CR3","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M. and Schneider, H.: Graph grammars: An algebraic approach, in 14th Annual IEEE Symposium on Switching and Automata Theory, IEEE, 1973, pp.167-180.","DOI":"10.1109\/SWAT.1973.11"},{"key":"206848_CR4","doi-asserted-by":"crossref","unstructured":"Rozenberg, G. (ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Volume 1: Foundations, World Scientific, 1997.","DOI":"10.1142\/9789812384720"},{"key":"206848_CR5","doi-asserted-by":"crossref","unstructured":"Nagl, M. (ed.): Building Tightly Integrated Software Development Environments: The IPSEN Approach, LNCS 1170, Springer-Verlag, 1996.","DOI":"10.1007\/BFb0035684"},{"key":"206848_CR6","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A., Winter, A. and Z\u00fcndorf, A.: Graph grammar engineering with PROGRES, in 5th European Software Engineering Conference (ESEC'95), Sitges, LNCS 989, Springer-Verlag, 1995, pp. 219-234.","DOI":"10.1007\/3-540-60406-5_17"},{"issue":"4","key":"206848_CR7","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S0218194097000266","volume":"7","author":"G. Engels","year":"1997","unstructured":"Engels, G., Heckel, R., Taentzer, G. and Ehrig, H.: A combined reference model-and viewbased approach to system specification, Internat. J. of Software and Knowledge Engrg.\n7(4) (1997), 457-477.","journal-title":"Internat. J. of Software and Knowledge Engrg."},{"key":"206848_CR8","doi-asserted-by":"crossref","unstructured":"Sch\u00fcrr, A.: Programmed graph replacement systems, in G. Rozenberg [4], pp. 479-546.","DOI":"10.1142\/9789812384720_0007"},{"key":"206848_CR9","unstructured":"Ermel, C., Rudolf, M. and Taentzer, G.: The AGG approach: Language and environment, in H. Ehrig et al. [10]. To appear."},{"key":"206848_CR10","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Engels, G., Kreowski, H.-J. and Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation, Volume 2: Applications, Languages, and Tools, World Scientific, 1999. To appear.","DOI":"10.1142\/9789812815149"},{"key":"206848_CR11","doi-asserted-by":"crossref","unstructured":"Ehrig, H.: Introduction to the algebraic theory of graph grammars, in V. Claus, H. Ehrig, and G. Rozenberg (eds.), 1st Graph Grammar Workshop, LNCS 73, Springer-Verlag, 1979, pp. 1-69.","DOI":"10.1007\/BFb0025714"},{"key":"206848_CR12","doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R. and L\u00f6we, M.: Algebraic approaches to graph transformation, Part I: Basic concepts and double pushout approach, in G. Rozenberg [4], pp. 163-245.","DOI":"10.1142\/9789812384720_0003"},{"issue":"1","key":"206848_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF00872984","volume":"1","author":"H. Ehrig","year":"1993","unstructured":"Ehrig, H. and L\u00f6we, M.: Categorical principles, techniques and results for high-level replacement systems in computer science, Appl. Categorical Structures\n1(1) (1993), 21-50.","journal-title":"Appl. Categorical Structures"},{"key":"206848_CR14","doi-asserted-by":"crossref","unstructured":"Corradini, A., Ehrig, H., L\u00f6we, M., Montanari, U. and Padberg, J.: The category of typed graph grammars and their adjunction with categories of derivations, in 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, LNCS 1073, Springer-Verlag, 1996, pp. 56-74.","DOI":"10.1007\/3-540-61228-9_79"},{"issue":"6","key":"206848_CR15","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1017\/S0960129500070110","volume":"6","author":"R. Heckel","year":"1996","unstructured":"Heckel, R., Corradini, A., Ehrig, H. and L\u00f6we, M.: Horizontal and vertical structuring of typed graph transformation systems, Math. Structures Comput. Sci.\n6(6) (1996), 613-648. Also Technical Report 96-22, TU Berlin.","journal-title":"Math. Structures Comput. Sci."},{"key":"206848_CR16","unstructured":"Heckel, R.: Open graph transformation systems: A new approach to the compositional modelling of concurrent and reactive systems, PhD thesis, TU Berlin, 1998."},{"issue":"10","key":"206848_CR17","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C. Hoare","year":"1986","unstructured":"Hoare, C.: An axiomatic basis for computer programming, Comm. ACM\n12(10) (1986), 576-580.","journal-title":"Comm. ACM"},{"key":"206848_CR18","volume-title":"Systematic Software Development Using VDM","author":"C. B. Jones","year":"1986","unstructured":"Jones, C. B.: Systematic Software Development Using VDM, Prentice-Hall International, London, 1986."},{"key":"206848_CR19","doi-asserted-by":"crossref","unstructured":"Kreowski, H.-J. and Kuske, S.: On the interleaving semantics of transformation units-a step into GRACE, in 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, LNCS 1073, Springer-Verlag, 1996, pp. 89-106.","DOI":"10.1007\/3-540-61228-9_81"},{"key":"206848_CR20","volume-title":"Understanding Z: A Specification Language and its Formal Semantics","author":"J. Spivey","year":"1988","unstructured":"Spivey, J.: Understanding Z: A Specification Language and its Formal Semantics, Cambridge University Press, Cambridge, 1988."},{"key":"206848_CR21","doi-asserted-by":"crossref","unstructured":"Manna, Z. and Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Specification, Springer-Verlag, 1992.","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"206848_CR22","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"Harel, D.: Statecharts: A visual formalism for complex systems, Sci. Comput. Programming\n8 (1987), 231-274.","journal-title":"Sci. Comput. Programming"},{"key":"206848_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus for Communicationg Systems, LNCS 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"206848_CR24","doi-asserted-by":"crossref","unstructured":"Engels, G., Heckel, R., Taentzer, G. and Ehrig, H.: A view-oriented approach to system modelling using graph transformation, in Proc. of ESEC\/FSE'97, Z\u00fcrich, LNCS 1301, Springer-Verlag, 1997, pp. 327-343.","DOI":"10.1007\/3-540-63531-9_23"},{"key":"206848_CR25","doi-asserted-by":"crossref","unstructured":"Heckel, R.: Compositional verification of reactive systems specified by graph transformation, in Fundamental Approaches to Software Engineering, LNCS 1382, Springer-Verlag, 1998, pp. 138-153.","DOI":"10.1007\/BFb0053588"},{"key":"206848_CR26","doi-asserted-by":"crossref","unstructured":"Bauderon, M.: A category-theoretical approach to vertex replacement: The generation of in-finite graphs, in 5th Int. Workshop on Graph Grammars and their Application to Computer Science, Williamsburg '94, LNCS 1073, Springer-Verlag, 1996, pp. 27-37.","DOI":"10.1007\/3-540-61228-9_77"},{"key":"206848_CR27","unstructured":"Bauderon, M. and Jacquet, H.: Categorical product as a generic graph rewriting mechanism, Appl. Categorical Structures (1999). To appear. Also Technical Report 1166-97, University of Bordeaux."},{"key":"206848_CR28","doi-asserted-by":"crossref","unstructured":"Engelfriet, J. and Rozenberg, G.: Node replacement graph grammars, in Rozenberg [4], pp. 1-94.","DOI":"10.1142\/9789812384720_0001"},{"issue":"3-4","key":"206848_CR29","first-page":"241","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U. and Rossi, F.: Graph processes, Fund. Inform.\n26(3-4) (1996), 241-266.","journal-title":"Fund. Inform."},{"key":"206848_CR30","doi-asserted-by":"crossref","unstructured":"Andries, M., Engels, G., Habel, A., Hoffmann, B., Kreowski, H.-J., Kuske, S., Plump, D., Sch\u00fcrr, A. and Taentzer, G.: Graph transformation for specification and programming, Sci. Comput. Programming (1999). To appear. Also Technical Report 7\/96 of University of Bremen.","DOI":"10.1016\/S0167-6423(98)00023-9"},{"key":"206848_CR31","unstructured":"Heckel, R., Engels, G., Ehrig, H. and Taentzer, G.: Classification and comparison of modularity concepts for graph transformation systems, in H. Ehrig et al. [10]. To appear."},{"key":"206848_CR32","unstructured":"Ribeiro, L.: A telephone system's specification using graph grammars, Technical Report 96-23, Technical University of Berlin, 1996."},{"key":"206848_CR33","unstructured":"Ehrig, H., Heckel, R., Llabres, M. and Orejas, F.: Construction and characterisation of doublepullback graph transitions, in Prelim. Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT'98), Paderborn, 1998."},{"key":"206848_CR34","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0022-0000(87)90030-4","volume":"34","author":"P. B\u00f6hm","year":"1987","unstructured":"B\u00f6hm, P., Fonio, H.-R. and Habel, A.: Amalgamation of graph transformations: a synchronization mechanism, J. Comput. System Sci.\n34 (1987), 377-408.","journal-title":"J. Comput. System Sci."},{"key":"206848_CR35","unstructured":"Heckel, R.: Embedding of conditional graph transformations, in G. Valiente Feruglio and F. Rosello Llompart (eds.), Proc. Colloquium on Graph Transformation and its Application in Computer Science, Technical Report B-19, Universitat de les Illes Balears, 1995."},{"issue":"2","key":"206848_CR36","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"Meseguer, J. and Montanari, U.: Petri nets are monoids, Inform. and Comput.\n88(2) (1990), 105-155.","journal-title":"Inform. and Comput."},{"key":"206848_CR37","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency, TCS\n96 (1992), 73-155.","journal-title":"TCS"},{"key":"206848_CR38","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1017\/S0960129500000694","volume":"5","author":"H. Reichel","year":"1995","unstructured":"Reichel, H.: An approach to object semantics based on terminal co-algebras, Math. Structures in Comput. Sci.\n5 (1995), 129-152.","journal-title":"Math. Structures in Comput. Sci."},{"key":"206848_CR39","unstructured":"Rutten, J.: Universal coalgebra: A theory of systems, Technical Report CS-R9652, CWI, 1996. To appear in TCS."},{"key":"206848_CR40","volume-title":"European Conference on Object-Oriented Programming (ECOOP)","author":"B. Jacobs","year":"1996","unstructured":"Jacobs, B.: Inheritance and cofree constructions, in P. Cointe (ed.), European Conference on Object-Oriented Programming (ECOOP), Springer LNCS 1098, Berlin, 1996."},{"key":"206848_CR41","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B. and Rutten, J.: A tutorial on (co)algebras and (co)induction, Bulletin of EATCS\n62 (1997), 222-259.","journal-title":"Bulletin of EATCS"},{"key":"206848_CR42","doi-asserted-by":"crossref","unstructured":"Turi, D. and Plotkin, G.: Towards a mathematical operational semantics, in Proc. of LICS'97, 1997, pp. 280-305.","DOI":"10.1109\/LICS.1997.614955"},{"key":"206848_CR43","doi-asserted-by":"crossref","unstructured":"Jacobs, B., Moss, L., Reichel, H. and Rutten, J. (eds.): 1thWorkshop on Coalgebraic Methods in Computer Science (CMCS'98), Lisbon, Portugal, Electronic Notes of TCS 11, Elsevier Science, 1998. http:\/\/www.elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(05)80564-X"},{"key":"206848_CR44","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory, Theoret. Comput. Sci.\n114 (1993), 299-315.","journal-title":"Theoret. Comput. Sci."},{"issue":"3-4","key":"206848_CR45","first-page":"287","volume":"26","author":"A. Habel","year":"1996","unstructured":"Habel, A., Heckel, R. and Taentzer, G.: Graph grammars with negative application conditions, Fund. Inform.\n26(3-4) (1996), 287-313.","journal-title":"Fund. Inform."},{"key":"206848_CR46","doi-asserted-by":"crossref","unstructured":"Heckel, R. and Wagner, A.: Ensuring consistency of conditional graph grammars-a constructive approach, in Proc. of SEGRAGRA'95 \"Graph Rewriting and Computation\", Electronic Notes of TCS 2, 1995. http:\/\/www.elsevier.nl\/locate\/entcs\/volume2.html.","DOI":"10.1016\/S1571-0661(05)80188-4"},{"key":"206848_CR47","doi-asserted-by":"crossref","unstructured":"Heckel, R., Ehrig, H., Wolter, U. and Corradini, A.: Integrating the specification techniques of graph transformation and temporal logic, in Proc. Mathematical Foundations of Computer Science (MFCS'97), Bratislava, LNCS 1295, Springer-Verlag, 1997, pp. 219-228.","DOI":"10.1007\/BFb0029965"},{"key":"206848_CR48","unstructured":"Gadducci, F., Heckel, R. and Koch, M.: Model checking graph-interpreted temporal formulas, in Prelim. Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT'98), Paderborn, 1998."},{"key":"206848_CR49","doi-asserted-by":"crossref","unstructured":"Corradini, A.: Concurrent graph and term graph rewriting, in U. Montanari and V. Sassone (eds.), Proc. CONCUR'96, LNCS 1119, Springer-Verlag, 1996, pp. 438-464.","DOI":"10.1007\/3-540-61604-7_69"},{"key":"206848_CR50","doi-asserted-by":"crossref","unstructured":"Nielsen, M., Priese, L. and Sassone, V.: Characterizing behavioural congruences for Petri nets, in Proc. CONCUR'95, LNCS 962, Springer-Verlag, 1995, pp. 175-189.","DOI":"10.1007\/3-540-60218-6_13"},{"key":"206848_CR51","first-page":"106","volume":"62","author":"H. Ehrig","year":"1997","unstructured":"Ehrig, H., Merten, A. and Padberg, J.: How to transfer concepts of abstract data types to petri nets?, EATCS Bulletin\n62 (1997), 106-114.","journal-title":"EATCS Bulletin"},{"key":"206848_CR52","unstructured":"Padberg, J., Jansen, L., Heckel, R. and Ehrig, H.: Interoperability in train control systems: Specification of scenarios using open nets, in Proc. Integrated Design and Process Technology (IDPT'98), Berlin, 1998."},{"key":"206848_CR53","unstructured":"Ehrig, H., Heckel, R., Padberg, J. and Rozenberg, G.: Graph transformation and other rulebased formalisms with incomplete information, in Prelim. Proc. 6th Int. Workshop on Theory and Application of Graph Transformation (TAGT'98), Paderborn, 1998."},{"key":"206848_CR54","unstructured":"Corradini, A., Gro\u00dfe-Rhode, M. and Heckel, R.: Structured transition systems as lax coalgebras, in B. Jacobs et al. [43]."}],"container-title":["Applied Categorical Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008734426504.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008734426504\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008734426504.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:38:21Z","timestamp":1747579101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008734426504"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["206848"],"URL":"https:\/\/doi.org\/10.1023\/a:1008734426504","relation":{},"ISSN":["0927-2852","1572-9095"],"issn-type":[{"type":"print","value":"0927-2852"},{"type":"electronic","value":"1572-9095"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}