乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:36:11Z","timestamp":1736314571324,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":31,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540530487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0039063","type":"book-chapter","created":{"date-parts":[[2006,1,31]],"date-time":"2006-01-31T14:58:08Z","timestamp":1138719488000},"page":"230-245","source":"Crossref","is-referenced-by-count":14,"title":["Superimposition for interacting processes"],"prefix":"10.1007","author":[{"given":"Nissim","family":"Francez","sequence":"first","affiliation":[]},{"given":"Ira R.","family":"Forman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Paul C. Attie, Nissim Francez, and Orna Grumberg. Fairness and hyperfairness in multi-party interactions. In 17th ACM-POPL, pages 292\u2013305, San-Francisco, CA, January 17\u201319 1990.","DOI":"10.1145\/96709.96739"},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"R. Krzysztof","year":"1988","unstructured":"Krzysztof R. Apt, Nissim Francez, and Shmuel M. Katz. Appraising fairness in distributed languages. Distributed Computing, 2:226\u2013241, August 1988.","journal-title":"Distributed Computing"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Luc Boug\u00e9 and Nissim Francez. A compositional approach to superimposition. In 15th ACM-POPL, pages 240\u2013249, San Diego, CA, January 13\u201315 1988.","DOI":"10.1145\/73560.73581"},{"issue":"4","key":"18_CR4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/48022.48023","volume":"10","author":"-. R. Ralph","year":"1988","unstructured":"Ralph-J. R. Back and Reino Kurki-Suonio. Distributed cooperation with action systems. TOPLAS, 10(4):513\u2013554, October 1988.","journal-title":"TOPLAS"},{"key":"18_CR5","unstructured":"Luc Boug\u00e9. Symmetry and generity for CSP distributed systems. Technical Report, LITP, Univ. Paris, May 7 1985."},{"issue":"2","key":"18_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/69624.357208","volume":"5","author":"G. N. Buckley","year":"1983","unstructured":"G. N. Buckley and A. Silberschatz. An efficient implementation for the generalized input-output construct of csp. ACM Trans. on Programming Languages and Systems, 5(2):223\u2013235, April 1983.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"18_CR7","unstructured":"B. Caillaud. The superimposition of estelle programs: a tool for the implementation of observation and control algorithms. In FORTE '89, October 1989."},{"issue":"1","key":"18_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/214451.214456","volume":"3","author":"K. Mani Chandy","year":"1985","unstructured":"K. Mani Chandy and Leslie Lamport. Distributed snapshots: determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1):63\u201375, February 1985.","journal-title":"ACM Transactions on Computer Systems"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"K. Mani Chandy and Jayadev Misra. Parallel program design: A foundation. Addison-Wesley, 1988.","DOI":"10.1007\/978-1-4613-9668-0_6"},{"issue":"8","key":"18_CR10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","volume":"18","author":"E. W. Dijkstra","year":"1975","unstructured":"Edsger W. Dijkstra. Guarded commands, nondterminacy and, formal derivation of programs. Communications of the ACM, 18(8):453\u2013457, August 1975.","journal-title":"Communications of the ACM"},{"issue":"1","key":"18_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E. W. Dijkstra","year":"1980","unstructured":"Edsger W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. IPL, 11(1):1\u20134, 1980.","journal-title":"IPL"},{"key":"18_CR12","first-page":"155","volume":"2","author":"T. Elrad","year":"1982","unstructured":"Tzilla Elrad and Nissim Francez. Decomposition of distributed programs into communication-closed layers. SCP, 2:155\u2013173, 1982.","journal-title":"SCP"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Nissim Francez and Ira R. Forman. Conflict propagation. In IEEE International Conference on Computer Languages (ICCL'90), pages 155\u2013168, New Orleans, LA, March 12\u201315 1990.","DOI":"10.1109\/ICCL.1990.63771"},{"key":"18_CR14","unstructured":"Nissim Francez and Ira R. Forman. Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming. Forthcoming book, 1990."},{"key":"18_CR15","unstructured":"Limor Fix, Nissim Francez, and Orna Grumberg. Semantics-driven decomposition for the verification of distributed programs. In IFIP WG 2.2\/2.3 working conference on programming concepts and methods, Sea of Galilee, Israel, April 2\u20135 1990."},{"issue":"1","key":"18_CR16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/357084.357087","volume":"2","author":"N. Francez","year":"1980","unstructured":"Nissim Francez. Distributed termination. ACM Trans. on Programming Languages and Systems, 2(1):42\u201355, January 1980.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(89)90049-5","volume":"32","author":"N. Francez","year":"1989","unstructured":"Nissim Francez. Cooperative proofs for distributed programs with multi-party interactions. IPL, 32:235\u2013242, September 22 1989.","journal-title":"IPL"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"E. Gafni. Perspectives on distributed network protocols: a case for building blocks. In Proc. MILCOMM 86, October 1986.","DOI":"10.1109\/MILCOM.1986.4805648"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Orna Grumberg, Nissim Francez, and Shmuel M. Katz. Fair termination of communicating processes. In Third ACM-PODC, Vancouver, BC, Canada, August 1984.","DOI":"10.1145\/800222.806752"},{"issue":"6","key":"18_CR20","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/TCOM.1983.1095883","volume":"31","author":"R. G. Gallager","year":"1983","unstructured":"R. G. Gallager, R. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. IEEE Trans. on Communications, 31(6):756\u2013762, 1983.","journal-title":"IEEE Trans. on Communications"},{"issue":"8","key":"18_CR21","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. Hoare","year":"1978","unstructured":"C. A. R. Hoare. Communicating sequential processes. Communications of the ACM, 21(8):666\u2013677, August 1978.","journal-title":"Communications of the ACM"},{"key":"18_CR22","unstructured":"Shmuel M. Katz. A superimposition control construct for distributed systems. Technical Report, Microelectronics and Computer Technology Corp., August 1987."},{"key":"18_CR23","unstructured":"Shmuel M. Katz. A superimposition control construct for distributed systems. Submitted to ACM-TOPLAS, November 1989."},{"key":"18_CR24","unstructured":"Shmuel M. Katz, Ira R. Forman, and W. Michael Evangelist. Language constructs for distributed systems. In IFIP TC2 Working Conference on Programming Concepts and Methods, Sea of Galilee, Israel, April 2\u20135 1990."},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Reino Kurki-Suonio and Hannu-Matti J\u00e4vinen. Action system approach to the specification and design of distributed systems. In Proceedings Fifth Int'l Workshop on Software Specification and Design, pages 34\u201340, May 19\u201320 1989.","DOI":"10.1145\/75200.75205"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"E. Korach, S. Kutten, and S. Moran. A modular technique for the design of efficient distributed leader finding algorithms. In Proc. 4th Annual ACM Symp. on Principles of Distributed Computing, 1985.","DOI":"10.1145\/323596.323611"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Gordon D. Plotkin. An operational semantics for csp. In D. Bjorner, editor, Formal description of programming concepts, North-Holland, Amsterdam, 1983. IFIP TC.2 WG conference, Garmisch Partenkierchen.","DOI":"10.1007\/3-540-11981-7_17"},{"key":"18_CR28","unstructured":"J. S. Schwarz. Distributed synchronization of communicating sequential processes. Technical Report, Dept. Artificial Intelligence, Univ. Edinburgh, 1978."},{"key":"18_CR29","unstructured":"Frank A. Stomp and Willem P. De Roever. A correctness proof of a distributed minimum-weight spanning tree algorithm. Technical Report, Dept. Informatics, Nimegen Univ., April 1987."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Nir Shavit and Nissim Francez. A new approach to detection of totally indicative stability. In Proc. 13th ICALP, July 1986.","DOI":"10.1007\/3-540-16761-7_84"},{"key":"18_CR31","unstructured":"G. Tel, R. B. Tan, and J. van Leeuwen. The derivation of graph marking algorithms from distributed termination algorithms. Technical Report, Univ. Utrecht, August 1986."}],"container-title":["Lecture Notes in Computer Science","CONCUR '90 Theories of Concurrency: Unification and Extension"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0039063.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T15:27:45Z","timestamp":1736263665000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0039063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540530487"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/bfb0039063","relation":{},"subject":[]}}