{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:42Z","timestamp":1725664062274},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578994"},{"type":"electronic","value":"9783540483854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57899-4_59","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:40:49Z","timestamp":1330263649000},"page":"276-287","source":"Crossref","is-referenced-by-count":0,"title":["The asynchronous committee meeting problem"],"prefix":"10.1007","author":[{"given":"Javier","family":"Esparza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Stengel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"24_CR1","first-page":"149","volume":"25 C","author":"G. Behrendt","year":"1988","unstructured":"G. Behrendt: Maximal antichains in partially ordered sets. Ars Combinatoria 25 C (1988), 149\u2013157.","journal-title":"Ars Combinatoria"},{"unstructured":"E. Best and C. Fern\u00e1ndez: Nonsequential Processes \u2014 A Petri Net View. EATCS Monographs on Theoretical Computer Science Vol. 13, Springer Verlag (1988).","key":"24_CR2"},{"unstructured":"K. M. Chandy and J. Misra: Parallel Program Design \u2014 A Foundation. Addison-Wesley (1988). (The meeting problem is considered on pages 14\u201318.)","key":"24_CR3"},{"doi-asserted-by":"crossref","unstructured":"J. Esparza: Model Checking Using Net Unfoldings. TAPSOFT'93: Theory and Practice of Software Development, M. C. Gaudel and J. P. Jouannaud (eds.), Lecture Notes in Computer Science 668 (1993), 613\u2013628.","key":"24_CR4","DOI":"10.1007\/3-540-56610-4_93"},{"unstructured":"M. R. Garey and D. S. Johnson: Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness. Freeman (1979).","key":"24_CR5"},{"key":"24_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.4064\/fm-65-2-157-167","volume":"65","author":"P. A. Grillet","year":"1969","unstructured":"P. A. Grillet: Maximal chains and antichains. Fundamenta Mathematicae 65 (1969), 157\u2013167.","journal-title":"Fundamenta Mathematicae"},{"key":"24_CR7","doi-asserted-by":"crossref","first-page":"11","DOI":"10.4064\/fm-79-1-11-22","volume":"79","author":"B. Leclerc","year":"1973","unstructured":"B. Leclerc and B. Monjardet: Ordres \u201cC.A.C.\u201d. Fundamenta Mathematicae 79 (1973), 11\u201322.","journal-title":"Fundamenta Mathematicae"},{"unstructured":"W. Reisig: Petri Nets \u2014 An Introduction. EATCS Monographs on Theoretical Computer Science Vol. 4, Springer Verlag (1985).","key":"24_CR8"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57899-4_59.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:09:39Z","timestamp":1619572179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57899-4_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578994","9783540483854"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-57899-4_59","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}