{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:23:52Z","timestamp":1736659432755,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540558224"},{"type":"electronic","value":"9783540472933"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[[1992]]},"DOI":"10.1007\/bfb0084801","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T13:12:14Z","timestamp":1164373934000},"page":"325-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Games I\/O automata play"],"prefix":"10.1007","author":[{"given":"Nick","family":"Reingold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Da -Wei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lenore D.","family":"Zuck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,9,30]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi and L. Lamport. Composing specifications. Research Report 66, DEC SRC, October 1990.","DOI":"10.1007\/3-540-52559-9_59"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra and J.W. Klop. Process theory based on bisimulation semantics. In LNCS 345, 1989.","DOI":"10.1007\/BFb0013021"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"B. Bloom. Constructing two-writer atomic registers. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 249\u2013259, 1987.","DOI":"10.1145\/41840.41861"},{"key":"24_CR4","unstructured":"M. Broy, F. Dederichs, C. Dendorfer, and R. Weber. Characterizing the behavior of reactive systems by trace sets (extended abstract). In Third Workshop on Concurrency and Compositionality, March 1991."},{"key":"24_CR5","unstructured":"A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Commutativity-based locking for nested transactions. Journal of Computer and System Science. to appear."},{"key":"24_CR6","first-page":"219","volume-title":"volume 312 of Lecture Notes in Computer Science","author":"A. Fekete","year":"1987","unstructured":"A. Fekete, N. Lynch, and L. Shrira. A Modular Proof of Correctness for a Network Synchronizer, volume 312 of Lecture Notes in Computer Science, pages 219\u2013256. Springer-Verlag, Amsterdam, Netherlands, July 1987."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"J. Y. Halpern and R. Fagin. Modeling knowledge and action in distributed systems. Technical Report, IBM, RJ6303, 1988.","DOI":"10.1007\/3-540-50403-6_29"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"J. Y. Halpern and L. D. Zuck, A little knowledge goes a long way: Simple knowledgebased derivations and correctness proofs for a family of protocols. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 269\u2013280, 1987. To appear in JACM.","DOI":"10.1145\/41840.41863"},{"issue":"33","key":"24_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D. Harel","year":"1987","unstructured":"D. Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8(33):231\u2013278, 6 1987.","journal-title":"Science of Computer Programming"},{"key":"24_CR10","unstructured":"M. Hennessy. Algebraic Theory of Process. MIT Press, 1988."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"M. Herlihy. Impossibility and universality results for wait-free synchronization. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pages 276\u2013290, 1988.","DOI":"10.1145\/62546.62593"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Process. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/69624.357207","volume":"5","author":"L. Lamport","year":"1983","unstructured":"L. Lamport. Specifying concurrent program modules. ACM Trans. on Programming Languages and Systems, 5(2):190\u2013222, 4 1983.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"issue":"3","key":"24_CR14","first-page":"219","volume":"2","author":"N. Lynch","year":"1989","unstructured":"N. Lynch and M. Tuttle. An introduction to input\/output automata. CWI Quarterly, 2(3):219\u2013246, September 1989.","journal-title":"CWI Quarterly"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"N. A. Lynch, Y. Mansour, and A. Fekete. Data link layer: Two impossibility results. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pages 149\u2013170, August 1988.","DOI":"10.21236\/ADA200983"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"N. A. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 137\u2013151, August 1987.","DOI":"10.1145\/41840.41852"},{"key":"24_CR17","first-page":"201","volume":"354","author":"Z. Manna","year":"1989","unstructured":"Z. Manna and A. Pnueli. The anchored version of temporal logic. In LNCS 354, pages 201\u2013284, 1989.","journal-title":"LNCS"},{"key":"24_CR18","unstructured":"R. Milner. Concurrency and Communication. Prentice-Hall, 1989."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Y. N. Moschovakis. A game-theoretic modeling of concurrency. In Proc. of the 4th annual Symp. on Logic in Computer Science, pages 154\u2013163. IEEE Computer Society Press, 1989.","DOI":"10.1109\/LICS.1989.39170"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Y. N. Moschovakis. Computable processes. In Proc. 18th ACM Symp. on Principles of Programming Languages, pages 72\u201380. IEEE Computer Society Press, 1990.","DOI":"10.1145\/96709.96716"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"D.-W. Wang and L. D. Zuck. Real-time sequence transmission problem. In Proc. 10th ACM Symp. on Principles of Distributed Computing, August 1991.","DOI":"10.1145\/112600.112611"},{"key":"24_CR22","unstructured":"D.-W. Wang, L. D. Zuck, and Nick Reingold. The power of I\/O automata. Unpublished manuscript, December 1990."},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"J. Welch, L. Lamport, and N. Lynch. A lattice-structured proof of a minimum spanning tree algorithm. In Proc. 7th ACM Symp. on Principles of Distributed Computing, pages 28\u201343, August 1988.","DOI":"10.21236\/ADA198312"}],"container-title":["Lecture Notes in Computer Science","CONCUR '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0084801","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T03:55:38Z","timestamp":1736654138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0084801"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540558224","9783540472933"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/bfb0084801","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]},"assertion":[{"value":"30 September 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}