{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:28Z","timestamp":1725456748113},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029628","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"347-354","source":"Crossref","is-referenced-by-count":1,"title":["A hierarchy of compositional models of I\/O-automata (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"37_CR1","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560\u2013599, 1984.","journal-title":"J. ACM"},{"issue":"1","key":"37_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(85)90130-6","volume":"39","author":"R.J.R. Back","year":"1985","unstructured":"R.J.R. Back and H. Mannila. On the suitability of trace semantics for modular proofs of communicating processes. Theoretical Computer Science, 39(1):47\u201368, 1985.","journal-title":"Theoretical Computer Science"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A model and proof system for asynchronous networks. In Proc. 4:th ACM Symp. on Principles of Distributed Computing, pages 49\u201358, Minaki, Canada, 1985.","DOI":"10.1145\/323596.323601"},{"key":"37_CR5","volume-title":"Compositional Verification of Distributed Systems","author":"B. Jonsson","year":"1987","unstructured":"B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Dept. of Computer Systems, Uppsala University, Sweden, Uppsala, Sweden, 1987. Available as report DoCS 87\/09."},{"key":"37_CR6","unstructured":"B. Jonsson. A hiearchy of compositional models of I\/O-automata. Technical report, Swedish Institute of Computer Science, 1990."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"B. Jonsson. On decomposing and refining specifications of distributed systems. In Proc. REX Workshop on Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science. Springer Verlag, 1990.","DOI":"10.1007\/3-540-52559-9_71"},{"key":"37_CR8","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, 1987.","DOI":"10.1145\/41840.41852"},{"issue":"4","key":"37_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"SE-7","author":"J. Misra","year":"1981","unstructured":"J. Misra and K.M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, SE-7(4):417\u2013426, July 1981.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"37_CR10","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"37_CR11","volume-title":"INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems","author":"J. Misra","year":"1984","unstructured":"J. Misra. Reasoning about networks of communicating processes. In INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, La Colle sur Loupe, France, 1984."},{"key":"37_CR12","unstructured":"Z. Manna and A. Pnueli. The temporal framework for concurrent programs. In Boyer and Moore, editors, The Correctness Problem in Computer Science, pages 215\u2013274. Academic Press, 1981."},{"issue":"1","key":"37_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01843567","volume":"1","author":"V. Nguyen","year":"1986","unstructured":"V. Nguyen, A. Demers, D. Gries, and S. Owicki. A model and temporal proof system for networks of processes. Distributed Computing, 1(1):7\u201325, 1986.","journal-title":"Distributed Computing"},{"key":"37_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola and M. Hennessy, Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"37_CR15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E.R. Olderog","year":"1986","unstructured":"E.R. Olderog and C.A.R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23(1):9\u201366, 1986.","journal-title":"Acta Informatica"},{"key":"37_CR16","unstructured":"F. Orava. Verifying safety and deadlock properties of networks of asynchronously communicating processes. In Proc. 9 th IFIP WG6.1 Symp. on Protocol Specification, Testing, and Verification, Twente, Holland, 1989."},{"key":"37_CR17","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"G.M. Reed and A.W. Roscoe. A timed model for communicating sequential processes. In Proc. ICALP 86, volume 226 of LNCS, pages 314\u2013323. Springer Verlag, 1986.","DOI":"10.1007\/3-540-16761-7_81"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"G.M. Reed and A.W. Roscoe. Metric spaces as models for real-time concurrency. In Proc. 3 rd Workshop on Math. Found. of Progr. Lang. Semantics, volume 298 of LNCS. Springer Verlag, 1988.","DOI":"10.1007\/3-540-19020-1_17"},{"key":"37_CR20","unstructured":"E.W. Stark. Foundations of a Theory of Specification for Distributed Systems. PhD thesis, Massachusetts Inst. of Technology, 1984. Available as Report No. MIT\/LCS\/TR-342."},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbaek and F.W. Vaandrager. Petri net models for algebraic theories of concurency. In Proc. PARLE, volume 259 of LNCS, pages 224\u2013242. Springer Verlag, 1987.","DOI":"10.1007\/3-540-17945-3_13"},{"key":"37_CR22","unstructured":"J. Zwiers. Compositionality, Concurrency and Partial Correctness, volume 321 of Lecture Notes in Computer Science. Springer Verlag, 1989."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029628","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:47:55Z","timestamp":1683308875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029628"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0029628","relation":{},"subject":[]}}