{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T10:23:42Z","timestamp":1760783022928},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_5","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"50-66","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Constraint-Based Analysis of Broadcast Protocols"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]},{"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"5_CR1","unstructured":"J. Esparza, A. Finkel, and R. Mayr. On the Verification of Broadcast Protocols. In Proc. 14th IEEE Int. Symp. on Logic in Computer Science, 1998."},{"key":"5_CR2","unstructured":"A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Technical Report LSV-98-4, Laboratoire Sp\u00e9cification et V\u00e9rification, Ecole Normale Sup\u00e9rieure de Cachan. April 1998. To appear in Theoretical Computer Science, 1999."},{"key":"5_CR3","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1978."},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/3-540-63166-6_48","volume-title":"Proc. 9th Conf. on Computer Aided Verification (CAV\u201997)","author":"T. A. Henzinger","year":"1997","unstructured":"T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. HyTech:a Model Checker for Hybrid Systems. In Orna Grumberg, editor, Proc. 9th Conf. on Computer Aided Verification (CAV\u201997), LNCS 1254, pp. 460\u2013463. Springer-Verlag, 1997."},{"key":"5_CR5","series-title":"Ph.D. thesis","volume-title":"Verification of Infinite State Systems: Decision Problems and Efficient Algorithms","author":"M. Kindahl","year":"1999","unstructured":"M. Kindahl. Verification of Infinite State Systems: Decision Problems and Efficient Algorithms. Ph.D. thesis, Department of Computer Systems, Uppsala University, June 1999. Available as report DoCS 110."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R. M. Karp","year":"1969","unstructured":"R. M. Karp and R. E. Miller. Parallel Program Schemata. Journal of Computer and System Sciences, 3, pp. 147\u2013195, 1969.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0304-3975(84)90029-X","volume":"32","author":"K. McAloon","year":"1984","unstructured":"K. McAloon. Petri Nets and Large Finite Sets. Theoretical Computer Science 32, pp. 173\u2013183, 1984.","journal-title":"Theoretical Computer Science"},{"key":"5_CR8","unstructured":"D. Srivistava. Subsumption and indexing in constraint query languages with linear arithmetic constraints. In 2nd Int. Symp. on Artificial Intelligence and Mathematics, Fort Lauderdale, 1992."},{"key":"5_CR9","unstructured":"E. Teruel. Structure Theory ofWeighte d Place\/Transition Net Systems: The Equal Conflict Hiatus. Ph.D. Thesis, University of Zaragoza, 1994."},{"issue":"2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0022-0000(86)90026-7","volume":"32","author":"M. Y. Vardi","year":"1986","unstructured":"M. Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal ofComputer and System Sciences. 32(2), pp. 183\u2013221, April, 1986.","journal-title":"Journal ofComputer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T04:08:06Z","timestamp":1586146086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}