{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:39Z","timestamp":1725664179124},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_98","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:59:42Z","timestamp":1330275582000},"page":"479-490","source":"Crossref","is-referenced-by-count":3,"title":["On the undecidability of deadlock detection in families of nets"],"prefix":"10.1007","author":[{"given":"Anne -C\u00e9cile","family":"Fabret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0020-0190(91)90217-6","volume":"37","author":"D. Beauquier","year":"1991","unstructured":"D. Beauquier. An undecidable problem about rational sets and contour words of polyominoes. Information Processing Letters, 37:257\u2013263, 1991.","journal-title":"Information Processing Letters"},{"key":"42_CR2","first-page":"334","volume":"480","author":"J. Beauquier","year":"1991","unstructured":"J. Beauquier, A. Choquet, A. Petit and G. Vidal-Naquet. Detection of deadlocks in an infinite family of nets. Proceedings of STACS'91, LNCS 480:334\u2013347, 1991.","journal-title":"LNCS"},{"key":"42_CR3","unstructured":"H.R. Lewis and C.H. Papadimitriou. Elements of the Theory of Computation. Prentice-Hall, 1981."},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"R. Berger. The undecidability of the domino problem. Memoirs of the American Mathematical Society, 66, 1966.","DOI":"10.1090\/memo\/0066"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Brookes and Roscoe. Deadlock analysis in networks of communicating process. Logic and Models of Concurrent Systems, NATO ASI series F, Vol. 13, 1985.","DOI":"10.1007\/978-3-642-82453-1_10"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"E. M. Clarke and O. Grumberg. Avoiding the State Explosion in Temporal Logic Model Checking Algorithms. Proceedings of PODC'87, ACM, 294\u2013303, 1987.","DOI":"10.1145\/41840.41865"},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"A.-C. Fabret and A. Petit. On the undecidability of deadlock detection in families of nets. Technical Report, LIFAC, ENS Cachan, 1994.","DOI":"10.1007\/3-540-59042-0_98"},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Z. Shtadler and O. Grumberg. Networks Grammars, Communication Behaviors and Automatic Verification. Proceedings of CAV'90, LNCS-407:151\u2013165, 1990.","DOI":"10.1007\/3-540-52148-8_13"},{"key":"42_CR9","unstructured":"A. P. Sistla and S. German. Reasoning with many processes. Proceedings of LICS'87, 1987."}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:18Z","timestamp":1605648318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}