{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:21:50Z","timestamp":1754482910444},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540525592"},{"type":"electronic","value":"9783540470359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52559-9_74","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:37:29Z","timestamp":1330205849000},"page":"414-453","source":"Crossref","is-referenced-by-count":64,"title":["Analysis of discrete event coordination"],"prefix":"10.1007","author":[{"given":"R. P.","family":"Kurshan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin, D. Scott, \u201cFinite Automata and their Decisions Problems\u201d, IBM J. Res. and Dev. 3 (1959) 114\u2013125. (Reprinted in [Mo64] 63\u201391.)","journal-title":"IBM J. Res. and Dev."},{"key":"16_CR2","unstructured":"M. L. Tsetlin, \u201cNon-primitive Circuits\u201d (in Russian) Problemy Kibernetiki 2 (1959)."},{"key":"16_CR3","unstructured":"J. R. B\u00fcchi, \u201cOn a Decision Method in Restricted Second-Order Arithmetic\u201d, Proc. Internat. Cong. on Logic, Methodol. and Philos. of Sci., 1960, 1\u201311 (Stanford Univ. Press, 1962)."},{"key":"16_CR4","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"M. O. Rabin, \u201cDecidability of Second-Order Theories and Automata on Infinite Trees\u201d, Trans. Amer. Math. Soc. 141 (1969) 1\u201335.","journal-title":"Trans. Amer. Math. Soc."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"M. O. Rabin, Automata on Infinite Objects and Church's Problem. Amer. Math. Soc., 1972.","DOI":"10.1090\/cbms\/013"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0022-0000(74)80051-6","volume":"8","author":"Y. Choueka","year":"1974","unstructured":"Y. Choueka, \u201cTheories of Automata on \u03c9-Tapes: A Simplified Approach\u201d, J. Comput. Syst. Sci. 8 (1974), 117\u2013141.","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9855-7","volume-title":"Lectures on Boolean Algebras","author":"P. Halmos","year":"1974","unstructured":"P. Halmos, Lectures on Boolean Algebras, Springer-Verlag, N.Y., 1974."},{"key":"16_CR8","unstructured":"B. Gopinath, R. P. Kurshan, \u201cThe Selection\/Resolution Model of Coordinating Concurrent Processes\u201d, internal AT&T report."},{"key":"16_CR9","unstructured":"S. Aggarwal, R. P. Kurshan, K. K. Sabnani, \u201cA Calculus for Protocol Specification and Validation\u201d in Protocol Specification, Testing and Verification, III, North-Holland, 1983, 19\u201334."},{"key":"16_CR10","unstructured":"D. L. Dill, E. M. Clarke, \u201cAutomatic Verification of Asynchronous Circuits Using Temporal Logic\u201d, Proc. Chapel Hill Conf. VLSI, Computer Sci. Press (1985) 127\u2013143."},{"key":"16_CR11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1090\/psapm\/031\/807813","volume":"3","author":"R. P. Kurshan","year":"1985","unstructured":"R. P. Kurshan, \u201cModelling Concurrent Processes\u201d, Proc. Symp. Applied Math. 3 (1985) 45\u201357.","journal-title":"Proc. Symp. Applied Math."},{"key":"16_CR12","unstructured":"A. P. Sistla, M. Y. Vardi, P. Wolper, \u201cThe Complementation Problem for B\u00fcchi Automata, with Applications to Temporal Logic\u201d, in Proc. 12th Internat. Coll. on Automata, Languages and Programming, Lect. Notes Comp. Sci., 1985, Springer-Verlag."},{"key":"16_CR13","unstructured":"W. W. Wadge, E. A. Ashcroft, LUCID, The Dataflow Programming Language, Academic Press, 1985."},{"key":"16_CR14","unstructured":"J. Katzenelson and R. P. Kurshan, \u201cS\/R: A Language For Specifying Protocols and Other Coordinating Processes\u201d, Proc. 5th Ann. Int'l Phoenix Conf. Comput. Commun., IEEE, 1986, 286\u2013292."},{"key":"16_CR15","unstructured":"M. C. Brown, E. M. Clarke, \u201cSML \u2014 A High Level Language for the Design and Verification of Finite State Machines\u201d, in From HDL Descriptions to Guaranteed Correct Circuit Designs (D. Borrione, ed.) North-Holland (1987) 269\u2013292."},{"key":"16_CR16","unstructured":"I. Gertner, R. P. Kurshan, \u201cLogical Analysis of Digital Circuits\u201d, Proc. 8th Intn'l. Conf. Comput. Hardware Description Languages, 1987, 47\u201367."},{"key":"16_CR17","first-page":"19","volume":"103","author":"R. P. Kurshan","year":"1987","unstructured":"R. P. Kurshan, \u201cReducibility in Analysis of Coordination\u201d, LNCIS 103 (1987) Springer Verlag, 19\u201339.","journal-title":"LNCIS"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0022-0000(87)90036-5","volume":"35","author":"R. P. Kurshan","year":"1987","unstructured":"R. P. Kurshan, \u201cComplementing Deterministic B\u00fcchi Automata in Polynomial Time\u201d, J. Comput. Syst. Sci. 35 (1987) 59\u201371.","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0325013","volume":"25","author":"P. J. Ramadge","year":"1987","unstructured":"P. J. Ramadge, W. M. Wonham, \u201cSupervisory Control of a Class of Discrete-Event Processes\u201d, SIAM J. Contr. Opt. 25 (1987) 206\u2013230.","journal-title":"SIAM J. Contr. Opt."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"S. Safra, \u201cOn the Complexity of \u03c9-Automata\u201d, 29th FOCS (1988) 319\u2013327.","DOI":"10.1109\/SFCS.1988.21948"},{"key":"16_CR21","first-page":"884","volume":"36","author":"J. Barwise","year":"1989","unstructured":"J. Barwise, \u201cMathematical Proofs of Computer System Correctness\u201d, Notices AMS 36 (1989) 884\u2013851.","journal-title":"Notices AMS"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"R. P. Kurshan, K. McMillan, \u201cA Structural Induction Theorem for Processes\u201d, Proc. 8th ACM Symp. PODC (1989) 239\u2013247.","DOI":"10.1145\/72981.72998"},{"key":"16_CR23","unstructured":"R. P. Kurshan, K. McMillan, \u201cAnalysis of Digital Circuits Through Symbolic Reduction\u201d, IEEE Trans. CAD\/ICS, to appear."},{"key":"16_CR24","unstructured":"Z. Har'El, R. P. Kurshan, \u201cSoftware for analytical Development of Communication Protocols\u201d, AT&T Tech. J., to appear."}],"container-title":["Lecture Notes in Computer Science","Stepwise Refinement of Distributed Systems Models, Formalisms, Correctness"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52559-9_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:37Z","timestamp":1605648277000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52559-9_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540525592","9783540470359"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-52559-9_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}