{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:46:46Z","timestamp":1725468406827},"publisher-location":"Berlin\/Heidelberg","reference-count":32,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387973753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040252","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T17:01:43Z","timestamp":1155834103000},"page":"1-21","source":"Crossref","is-referenced-by-count":9,"title":["A generalized Kahn Principle for abstract asynchronous networks"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"S. Abramsky. Reasoning about concurrent systems: a functional approach. In F. Chambers, D. Duce, and G. Jones, editors, Distributed Computing, volume 20 of APIC Studies in Data Processing, pages 307\u2013319. Academic Press, 1984."},{"key":"1_CR2","unstructured":"M. A. Arbib and E. Manes. Arrows, Structures and Functors: the Categorical Imperative. Academic Press, 1975."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"J. D. Brock and W. B. Ackerman. Scenarios: a model of nondeterminate computation. In Formalization of Programming Concepts, pages 252\u2013259. Springer-Verlag, 1981. Lecture Notes in Computer Science Vol. 107.","DOI":"10.1007\/3-540-10699-5_102"},{"key":"1_CR4","unstructured":"H. Barendregt. The Lambda Calculus: Its Syntax and Semantics. North-Holland, revised edition, 1984."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"T. Coquand, C. Gunter, and G. Winskel. dI-domains as a model of polymorphism. In Third Workshop on the Mathematical Foundations of Programming Language Semantics, pages 344\u2013363. Springer-Verlag, 1987.","DOI":"10.1007\/3-540-19020-1_18"},{"key":"1_CR6","unstructured":"Pierre-Louis Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Pitman, 1986."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"A. Faustini. The equivalence of a denotational and an operational semantics for pure dataflow. PhD thesis, University of Warwick, 1982.","DOI":"10.1007\/BFb0012771"},{"key":"1_CR8","unstructured":"J. Glauert, J. Gurd, C. Kirkham, and I. Watson. The dataflow approach. In Distributed Computing, volume 20 of APIC Studies in Data Processing, pages 1\u201353. Academic Press, 1984."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"C. Gunter and A. Jung. Coherence and consistency in domains. In Third Annual Symposium on Logic in Computer Science, pages 309\u2013317. Computer Society Press of the IEEE, 1988.","DOI":"10.1109\/LICS.1988.5129"},{"key":"1_CR10","unstructured":"H. Gaifman and V. R. Pratt. Partial order models of concurrency and the computation of functions. In Symposium on Logic in Computer Science, pages 72\u201385. Computer Society Press of the IEEE, 1987."},{"key":"1_CR11","unstructured":"C. Gunter and D. S. Scott. Semantic domains. Technical Report MS-CIS-89-16, University of Pennsylvania, Department of Computer and Information Science, 1989."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"P. Henderson. Purely functional operating systems. In J. Darlington, P. Henderson, and D. Turner, editors, Functional Programming. Cambridge University Press, 1982.","DOI":"10.1145\/800068.802148"},{"key":"1_CR13","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A fully abstract trace model for dataflow networks. In Sixteenth Annual ACM Symposium on Principles of Programming Languages, pages 155\u2013165, 1989.","DOI":"10.1145\/75277.75291"},{"key":"1_CR15","volume-title":"Information Processing 74","author":"G. Kahn","year":"1974","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In J. L. Rosenfeld, editor, Information Processing 74, pages 471\u2013475, Amsterdam, 1974. North Holland."},{"key":"1_CR16","unstructured":"R. M. Keller. Denotational models for parallel programs with indeterminate operators. In E. J. Neuhold, editor, Formal Description of Programming Concepts, pages 337\u2013366. North Holland, 1978."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"R. M. Keller, G. Lindstrom, and S. Patil. A loosely-coupled applicative multiprocessing system. In AFIPS Conference Proceedings 46, pages 613\u2013622, 1979.","DOI":"10.1109\/MARK.1979.8817294"},{"key":"1_CR18","first-page":"993","volume-title":"Information Processing 77","author":"G. Kahn","year":"1977","unstructured":"G. Kahn and D. B. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist, editor, Information Processing 77, pages 993\u2013998, Amsterdam, 1977. North Holland."},{"key":"1_CR19","unstructured":"G. Kahn and G. Plotkin. Domaines concrets. Technical Report 336, IRIA-Laboria, 1978."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input\/output automata. Information and Computation, 1988. To appear.","DOI":"10.1016\/0890-5401(89)90066-7"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Basic notions of trace theory. In J. W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, pages 285\u2013363. Springer-Verlag, 1989. Lecture Notes in Computer Science Vol. 354.","DOI":"10.1007\/BFb0013025"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0019-9958(82)80087-9","volume":"52","author":"A. Meyer","year":"1982","unstructured":"Albert Meyer. What is a model of the lambda calculus? Information and Control, 52:87\u2013122, 1982.","journal-title":"Information and Control"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"J. Misra. Equational reasoning about nondeterministic processes. Department of Computer Science, The University of Texas at Austin, 1989.","DOI":"10.1145\/72981.72983"},{"key":"1_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1971","unstructured":"S. Mac Lane. Categories for the Working Mathematician. Springer-Verlag, Berlin, 1971."},{"key":"1_CR25","unstructured":"D. Park. The \u201cfairness\u201d problem and non-deterministic computing networks. In Foundations of Computer Science IV Part 2, volume 159 of Mathematical Centre Tracts, pages 133\u2013161. Centrum voor Wiskunde en Informatica, 1982."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"V. R. Pratt. On the composition of processes. In Ninth Annual ACM Symposium on Principles of Programming Languages, 1982.","DOI":"10.1145\/582153.582177"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"P. Panangaden and E. W. Stark. Computation, residuals and the power of indeterminacy. In Automata, Languages and Programming, pages 439\u2013454. Springer-Verlag, 1988. Lecture Notes in Computer Science Vol. 317.","DOI":"10.1007\/3-540-19488-6_133"},{"key":"1_CR28","unstructured":"W. Reisig. Petri Nets, volume 4 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985."},{"key":"1_CR29","unstructured":"W. W. Wadge and E. A. Ashcroft. Lucid, the Dataflow Programming Language, volume 22 of APIC Studies in Data Processing. Academic Press, 1985."},{"key":"1_CR30","unstructured":"G. Winskel. Synchronisation trees. Theoretical Computer Science, May 1985."},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Petri Nets: Applications and Relationships to other Models of Concurrency. Springer-Verlag, 1986. Lecture Notes in Computer Science Vol. 255.","DOI":"10.1007\/3-540-17906-2_31"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"G. Winskel. A category of labelled Petri nets and compositional proof system. In Third Annual Symposium on Logic in Computer Science, pages 142\u2013154. Computer Society Press of the IEEE, 1988.","DOI":"10.1109\/LICS.1988.5113"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040252.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T15:15:13Z","timestamp":1683558913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040252"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387973753"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/bfb0040252","relation":{},"subject":[]}}