{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:17Z","timestamp":1761610337216,"version":"build-2065373602"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5688,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1998]]},"DOI":"10.1016\/s1571-0661(05)80237-3","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"204-213","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["True Concurrency = Interleaving Concurrency + Weak Conflict"],"prefix":"10.1016","volume":"14","author":[{"given":"Leila","family":"Ribeiro Korff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Korff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1986","series-title":"Actors: A model of concurrent computation in distributed systems","author":"Agha","key":"10.1016\/S1571-0661(05)80237-3_BIB1"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB2","first-page":"245","article-title":"Concurrent computing: from Petri nets to graph grammars","volume":"2","author":"Corradini","year":"1995","journal-title":"Eletronic Notes in Theoretical Computer Science, Proc. of the SEGRAGRA'95 Workshop on Graph Rewriting and Computation"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB3","series-title":"The Handbook of Graph Grammars, Volume 1: Foundations, World Scientific","article-title":"Algebraic approaches to graph transformation II: Single pushout approach and comparison with double pushout approach","author":"Ehrig","year":"1996"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB4","first-page":"1","article-title":"Introduction to the algebraic theory of graph grammars. 1st Graph Grammar Workshop, Lecture Notes in Computer Science 73","author":"Ehrig","year":"1979"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(93)90238-O","volume":"112","author":"Janicki","year":"1993","journal-title":"Structure of concurrency, Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB6","first-page":"234","article-title":"Single pushout transformations of equationally defined graph structures with applications to actor systems,","volume":"776","author":"Korff","year":"1994"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB7","series-title":"Information Systems - Correctness and Reusability","first-page":"33","article-title":"True concurrency semantics for single pushout graph transformations with applications to actor systems","author":"Korff","year":"1995"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB8","unstructured":"Korff, M., Generalized graph structure grammars with applications to concurrent object-oriented systems, Ph.D. thesis, Technical University of Berlin, 1996."},{"key":"10.1016\/S1571-0661(05)80237-3_BIB9","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-61228-9_94","article-title":"Formal relationship between graph grammars and Petri nets","volume":"1073","author":"Korff","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB10","first-page":"234","article-title":"Parallelism in single-pushout graph rewriting","volume":"776","author":"L\u00f6we","year":"1994","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","article-title":"Algebraic approach to single-pushout graph transformation","volume":"109","author":"L\u00f6we","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB12","article-title":"Contextual nets","volume":"Vol. 32","author":"Montanari","year":"1995"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB13","first-page":"41","article-title":"(organizer), The use of graph grammars in applications, Graph Grammars and Their Applications to Computer Science, Springer","volume":"532","author":"Nagl","year":"1991","journal-title":"LNCS, Panel discussion"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB14","unstructured":"Ribeiro, L., A telephone system's specification using graph grammars, Tech. Report 96-23, Technical University of Berlin, 1996."},{"key":"10.1016\/S1571-0661(05)80237-3_BIB15","first-page":"199","article-title":"Graph grammars for the specification of concurrent systems","author":"Ribeiro","year":"1997","journal-title":"Proc. of the IX SBES Brazilian Software Engineering Symposium (Fortaleza \u2014 Brazil)"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB16","doi-asserted-by":"crossref","unstructured":"Taentzer, G., Parallel and distributed graph transformation: Formal description and application to communication-based systems, Ph.D. thesis, Technical University of Berlin, 1996.","DOI":"10.1007\/3-540-61228-9_95"},{"key":"10.1016\/S1571-0661(05)80237-3_BIB17","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","first-page":"364","article-title":"An introduction to event structures","author":"Winskel","year":"1989"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802373?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802373?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:33Z","timestamp":1761610053000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802373"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"references-count":17,"alternative-id":["S1571066105802373"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80237-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"True Concurrency = Interleaving Concurrency + Weak Conflict","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80237-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1998 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}