{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:51Z","timestamp":1725663291239},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_24","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:09:19Z","timestamp":1330189759000},"page":"326-334","source":"Crossref","is-referenced-by-count":1,"title":["Reachability homomorphisms on nets"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Ebert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Perl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"24_CR1","unstructured":"J\u00fcrgen Ebert An analogy between nets and hypergraphs Newsletter No. 4, Feb. 1980, Gesellschaft f\u00fcr Informatik, SIG \"Petri Nets and Related System Models\", 7\u201310"},{"key":"24_CR2","unstructured":"J\u00fcrgen Ebert Erreichbarkeits-konsistente Vergr\u00f6berungen von Netzen Osnabr\u00fccker Schriften zur Mathematik, Reihe M, 1980"},{"key":"24_CR3","first-page":"101","volume-title":"Discrete Structures and Algorithms","author":"J. Perl","year":"1980","unstructured":"J\u00fcrgen Perl Reachability-homomorphisms on graphs in U. Pape, \"Discrete Structures and Algorithms\", Hanser Verlag, M\u00fcnchen-Wien, 1980, 101\u2013112"},{"key":"24_CR4","unstructured":"J\u00fcrgen Perl \u00fcbertragung des Markierungsbegriffs auf vergr\u00f6berte Petrinetze Osnabr\u00fccker Schriften zur Mathematik, Reihe M, 1980"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:36:54Z","timestamp":1619555814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}