{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:59:34Z","timestamp":1648688374106},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2002,5,8]],"date-time":"2002-05-08T00:00:00Z","timestamp":1020816000000},"content-version":"unspecified","delay-in-days":37,"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,4]]},"abstract":"We define a construction operation on hypergraphs based on a colimit and show that its \nexpressiveness is equal to the graph expressions of Bauderon and Courcelle. We also \ndemonstrate that by closing a set of rewrite rules under graph construction we obtain a \nnotion of rewriting equivalent to the double-pushout approach of Ehrig. The usefulness of \nour approach for the compositional modelling of concurrent systems is then demonstrated \nby giving a semantics of process graphs (corresponding to a process calculus with mobility) \nand of Petri nets. We introduce on the basis if a hypergraph construction, a method for the \nstatic analysis of process graphs, related to type systems.<\/jats:p>","DOI":"10.1017\/s0960129501003486","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T19:18:00Z","timestamp":1027883880000},"page":"149-175","source":"Crossref","is-referenced-by-count":1,"title":["Hypergraph construction and its application to the static analysis of concurrent systems"],"prefix":"10.1017","volume":"12","author":[{"given":"BARBARA","family":"K\u00d6NIG","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,5,8]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129501003486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T15:24:44Z","timestamp":1553873084000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129501003486\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0960129501003486"],"URL":"https:\/\/doi.org\/10.1017\/s0960129501003486","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}