{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T03:31:02Z","timestamp":1648783862890},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2002,9,16]],"date-time":"2002-09-16T00:00:00Z","timestamp":1032134400000},"content-version":"unspecified","delay-in-days":46,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2002,8]]},"abstract":"Graph transitions represent an extension of the DPO approach to graph transformation for \nthe specification of reactive systems. In this paper, we develop the theory of concurrency for \ngraph transitions. In particular, we prove a local Church\u2013Rosser theorem and define a \nnotion of shift-equivalence that allows us to represent both intra-concurrency (within the \nspecified subsystem) and inter-concurrency (between subsystem and environment). Via an \nimplementation of transitions in terms of DPO transformations with context rules, a second, \nmore restrictive notion of equivalence is defined that captures, in addition, the \nextra-concurrency (between operations of the environment). As a running example and \nmotivation, we show how the concepts of this paper provide a formal model for distributed \ninformation systems.<\/jats:p>","DOI":"10.1017\/s0960129501003553","type":"journal-article","created":{"date-parts":[[2002,9,20]],"date-time":"2002-09-20T12:50:31Z","timestamp":1032526231000},"page":"349-376","source":"Crossref","is-referenced-by-count":6,"title":["Concurrency and loose semantics of open graph \ntransformation systems"],"prefix":"10.1017","volume":"12","author":[{"given":"REIKO","family":"HECKEL","sequence":"first","affiliation":[]},{"given":"MERC\u00c9","family":"LLABR\u00c9S","sequence":"additional","affiliation":[]},{"given":"HARTMUT","family":"EHRIG","sequence":"additional","affiliation":[]},{"given":"FERNANDO","family":"OREJAS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,9,16]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129501003553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T19:33:16Z","timestamp":1554319996000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129501003553\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0960129501003553"],"URL":"https:\/\/doi.org\/10.1017\/s0960129501003553","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}