{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:15:04Z","timestamp":1737090904855,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000297"},{"type":"electronic","value":"9783540361039"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-36103-0_29","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T03:15:07Z","timestamp":1179285307000},"page":"262-274","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Detecting Deadlock in Ada Rendezvous Flow Structure Based on Process Algebra"],"prefix":"10.1007","author":[{"given":"Yuan","family":"Liu","sequence":"first","affiliation":[]},{"given":"Baowen","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Zhenqiang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,10]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"J.C.M. Baeten","year":"1990","unstructured":"J.C.M. Baeten, W.P. Weijland. Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990."},{"volume-title":"Applications of Process Algebra","year":"1990","key":"29_CR2","unstructured":"J.C.M. Baeten, editor. Applications of Process Algebra. Cambridge University Press, Cambridge, United Kingdom, 1990."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. A. Bergstra","year":"1984","unstructured":"J. A. Bergstra, J. W. Klop, Process Algebra for Synchronous Communication. Information and Control, 60:109\u2013137, 1984.","journal-title":"Information and Control"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"J. Blieberger, B. Burgstaller, B. Scholz. Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs. In Proc. of the Ada-Europe International Conference on Reliable Software Technologies, Potsdam, Germany, June 2000. Springer.","DOI":"10.1007\/10722060_21"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/375431.375420","volume":"36","author":"Z. C. B. Xu","year":"2001","unstructured":"Zhenqiang Chen Baowen Xu. Slicing Concurrent Java Programs. ACM SIGPLAN Notices, 2001, 36(4): 41\u201347.","journal-title":"ACM SIGPLAN Notices"},{"key":"29_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BFb0018493","volume-title":"Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets","author":"J. Cheng","year":"1991","unstructured":"J. Cheng, K. Ushijima. Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets. In Lecture Notes in Computer Science #499, pp 125\u2013146, Springer-Verlag, 1991."},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/32.489078","volume":"22","author":"J. C. Corbett","year":"1996","unstructured":"James C. Corbett, Evaluating Deadlock Detection Methods for Concurrent Software. IEEE Transactions on Software Engineering, 1996, 22(3): 161\u2013180.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Matthew B. Dwyer, Kari A. Nies, Lori A. Clarke. Compact Petri Net Representation for Concurrent Programs. ICSE, 1994.","DOI":"10.1145\/225014.225028"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"R. Gedela, S. Shatz, H. Xu. Former Modeling of Synchronization Methods for Concurrent Objects in Ada 95. Proceedings of the ACM Annual International Conference on Ada (SIGAda-99), Redondo Beach, Calif., Oct. 1999, pp. 211\u2013220.","DOI":"10.1145\/319295.319325"},{"issue":"1","key":"29_CR10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1049\/sej.1993.0003","volume":"8","author":"A.H.M ter Hofstede","year":"1993","unstructured":"A.H.M ter Hofstede. Task Structure Semantics through Process Algebra. Software Engineering Journal, 8(1): 14\u201320, January 1993.","journal-title":"Software Engineering Journal"},{"key":"29_CR11","unstructured":"ISO\/IEC 8652:1995(E). Ada Reference Manual-Language and Standard Libraries."},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Douglas L. Long, Lori A. Clarke. Task Interaction Graphs for Concurrency Analysis. In Proceedings of the 11 th ICSE, pp 44\u201352, Pittsburgh, May 1989.","DOI":"10.1145\/74587.74592"},{"key":"29_CR13","unstructured":"Stephen P. Masticola, Static Detection of Deadlocks in Polynomial Time. A dissertation submitted to the Graduate School-New Brunswick Rutgers, The State University of New Jersey, May, 1993."},{"key":"29_CR14","isbn-type":"print","volume-title":"Petri Net Theory and the Modeling of Systems","author":"J. L. Peterson","year":"1981","unstructured":"J. L. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, N.J., 1981, ISBN 0-13661-983-5.","ISBN":"https:\/\/id.crossref.org\/isbn\/0136619835"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF00263928","volume":"19","author":"R.N. Taylor","year":"1983","unstructured":"R.N. Taylor. Complexity of Analyzing the Synchronization Structure of Concurrent Programs. Acta Informatica, 19:57\u201384, 1983.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Formal Methods and Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36103-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:19:35Z","timestamp":1737019175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36103-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000297","9783540361039"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36103-0_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"10 October 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}