{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:42:43Z","timestamp":1725468163298},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055052","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T12:08:05Z","timestamp":1154434085000},"page":"188-199","source":"Crossref","is-referenced-by-count":2,"title":["Robust asynchronous protocols are finite-state"],"prefix":"10.1007","author":[{"given":"Madhavan","family":"Mukund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. Narayan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaikumar","family":"Radhakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milind","family":"Sohoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"P.A. Abdulla and B. Jonsson: Verifying programs with unreliable channels, in Proc. 8th IEEE Symp. Logic in Computer Science, Montreal, Canada (1993).","DOI":"10.1109\/LICS.1993.287591"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0022-0000(80)90009-4","volume":"20","author":"A. Ginzburg","year":"1980","unstructured":"A. Ginzburg and M. Yoeli: Vector addition systems and regular languages, J. Comput. System. Sci.\n                20 (1980) 277\u2013284","journal-title":"J. Comput. System. Sci."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S.A. Greibach","year":"1978","unstructured":"S.A. Greibach: Remarks on blind and partially blind one-way multicounter machines, Theoret. Comput. Sci\n                7 (1978) 311\u2013324.","journal-title":"Theoret. Comput. Sci"},{"key":"17_CR4","unstructured":"M. Hack: Petri Net Languages, C.S.G. Memo 124, Project MAC, MIT (1975)."},{"key":"17_CR5","unstructured":"G.J. Holzmann: Design and validation of computer protocols, Prentice Hall (1991)."},{"key":"17_CR6","unstructured":"M. Jantzen: Language theory of Petri nets, in W. Brauer, W. Reisig, G. Rozenberg (eds.), Advances in Petri Nets, 1986, Vol 1, Springer LNCS 254 (1986) 397\u2013412."},{"issue":"4","key":"17_CR7","first-page":"167","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"R.M. Karp and R.E. Miller: Parallel program schemata, J. Comput. System Sci., 3 (4) (1969) 167\u2013195.","journal-title":"J. Comput. System Sci."},{"key":"17_CR8","unstructured":"N.A. Lynch and M. Tuttle: Hierarchical correctness proofs for distributed algorithms, MIT\/LCS\/TR-387, Laboratory for Computer Science, MIT (1987)."},{"key":"17_CR9","first-page":"249","volume-title":"Workshops in Computing Series","author":"M. Mukund","year":"1995","unstructured":"M. Mukund, K. Narayan Kumar and M. Sohoni: Keeping track of the latest gossip in message-passing systems, Proc. Structures in Concurrency Theory (STRICT), Berlin 1995, Workshops in Computing Series, Springer-Verlag (1995) 249\u2013263."},{"key":"17_CR10","volume-title":"Report TCS-97-4","author":"M. Mukund","year":"1997","unstructured":"M. Mukund, K. Narayan Kumar, J. Radhakrishnan and M. Sohoni: Counter automata and asynchronous communication, Report TCS-97-4, SPIC Mathematical Institute, Madras, India (1997)."},{"key":"17_CR11","volume-title":"Report TCS-94-2","author":"M. Mukund","year":"1994","unstructured":"M. Mukund and M. Sohoni: Gossiping, asynchronous automata and Zielonka's theorem, Report TCS-94-2, School of Mathematics, SPIC Science Foundation, Madras, India (1994)."},{"key":"17_CR12","first-page":"439","volume":"317","author":"P. Panangaden","year":"1988","unstructured":"P. Panangaden and E.W. Stark: Computations, residuals, and the power of indeterminacy, Proc. ICALP '88, Springer LNCS 317 (1988) 439\u2013454.","journal-title":"Springer LNCS"},{"key":"17_CR13","unstructured":"J.L. Peterson: Petri net theory and the modelling of systems, Prentice Hall (1981)."},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(81)90067-2","volume":"23","author":"R. Valk","year":"1981","unstructured":"R. Valk and G. Vidal-Naquet: Petri nets and regular languages, J. Comput. System. Sci.\n                23 (3) (1981) 299\u2013325.","journal-title":"J. Comput. System. Sci."},{"key":"17_CR15","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka: Notes on finite asynchronous automata, R.A.I.R.O.\u2014Inf. Th\u00e9or. et Appl., 21 (1987) 99\u2013135.","journal-title":"R.A.I.R.O.\u2014Inf. Th\u00e9or. et Appl."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T19:49:02Z","timestamp":1549914542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0055052","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}