{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:25Z","timestamp":1725456985662},"publisher-location":"Berlin\/Heidelberg","reference-count":19,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032041","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"308-321","source":"Crossref","is-referenced-by-count":11,"title":["Stability and sequentiality in dataflow networks"],"prefix":"10.1007","author":[{"given":"Prakash","family":"Panangaden","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasant","family":"Shanbhogue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene W.","family":"Stark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(88)90051-5","volume":"60","author":"I. J. Aalbersberg","year":"1988","unstructured":"I. J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60(1):1\u201382, 1988.","journal-title":"Theoretical Computer Science"},{"key":"25_CR2","unstructured":"M. Bednarczyk. Categories of Asynchronous Systems. PhD thesis, University of Sussex, October 1987."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"G. Berry. Stable models of typed lambda-calculi. In Proceedings of the Fifth International Colloquium on Automata Languages And Programming, pages 72\u201389, 1978. Springer-Verlag Lecture Notes In Computer Science 62.","DOI":"10.1007\/3-540-08860-1_7"},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0304-3975(82)80002-9","volume":"20","author":"G. Berry","year":"1982","unstructured":"G. Berry and P.-L. Curien. Sequential algorithms on concrete data structures. Theoretical Computer Science, 20:265\u2013321, 1982.","journal-title":"Theoretical Computer Science"},{"key":"25_CR5","unstructured":"P.-L. Curien. Categorical Combinators, Sequential Algorithms and Functional Programming. Research Notes in Theoretical Computer Science, John Wiley and Sons, 1986."},{"key":"25_CR6","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In Information Processing 74, pages 993\u2013998, North-Holland. 1977."},{"key":"25_CR7","unstructured":"G. Kahn and G. Plotkin. Structures de donn\u00e9es concr\u00e8tes. Technical Report 336, IRIA-LABORIA, 1978."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"M. Kwiatkowska. Fairness for Non-Interleaving Concurrency. PhD thesis, University of Leicester, May 1989.","DOI":"10.1007\/BF01887206"},{"issue":"1","key":"25_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0890-5401(89)90066-7","volume":"82","author":"N. A. Lynch","year":"1989","unstructured":"N. A. Lynch and E. W. Stark. A proof of the Kahn principle for input\/output automata. Information and Computation, 82(1):81\u201392, July 1989.","journal-title":"Information and Computation"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz. Trace theory. In Petri Nets: Application and Relation to other Models of Concurrency, pages 279\u2013324, Springer-Verlag, September 1986.","DOI":"10.1007\/3-540-17906-2_30"},{"key":"25_CR11","unstructured":"P. Panangaden and V. Shanbhogue. On The Expressive Power of Indeterminate Primitives. Technical Report 87-891, Cornell University, Computer Science Department, November 1987."},{"key":"25_CR12","unstructured":"P. Panangaden, V. Shanbhogue, and E. W. Stark. Stability and Sequentiality in Dataflow Networks. Technical Report 89\u20131055, Cornell University Dept. of Computer Science, 1989. (also SUNY at Stony Brook CS Dept. TR-89-27)."},{"key":"25_CR13","first-page":"439","volume":"317","author":"P. Panangaden","year":"1988","unstructured":"P. Panangaden and E. W. Stark. Computations, residuals, and the power of indeterminacy. In Automata, Languages, and Programming, pages 439\u2013454, Springer-Verlag. Volume 317 of Lecture Notes in Computer Science, 1988.","journal-title":"Automata, Languages, and Programming"},{"issue":"3","key":"25_CR14","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"G. Plotkin. Lcf considered a programming language. Theoretical Computer Science, 5(3):223\u2013256, 1977.","journal-title":"Theoretical Computer Science"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"M. W. Shields. Deterministic asynchronous automata. In Formal Methods in Programming, North-Holland. 1985.","DOI":"10.1007\/3-540-15641-0_26"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"E. W. Stark. Concurrent transition system semantics of process networks. In Fourteenth ACM Symposium on Principles of Programming Languages, pages 199\u2013210, January 1987.","DOI":"10.1145\/41625.41643"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","volume":"64","author":"E. W. Stark","year":"1989","unstructured":"E. W. Stark. Concurrent transition systems. Theoretical Computer Science, 64:221\u2013269, 1989.","journal-title":"Theoretical Computer Science"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"E. W. Stark. Connections between a concrete and an abstract model of concurrent systems. In Mathematical Foundations of Programming Language Semantics, Springer-Verlag. Lecture Notes in Computer Science, 1990. (to appear).","DOI":"10.1007\/BFb0040254"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"E. W. Stark. On the relations computed by a class of concurrent automata. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 329\u2013340, January 1990.","DOI":"10.1145\/96709.96743"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:45:03Z","timestamp":1586612703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0032041","relation":{},"subject":[]}}