{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:17:29Z","timestamp":1648509449351},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/bf00289044","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T17:16:50Z","timestamp":1096910210000},"page":"293-307","source":"Crossref","is-referenced-by-count":1,"title":["Functional behavior in data spaces"],"prefix":"10.1007","volume":"9","author":[{"given":"Armin B.","family":"Cremers","sequence":"first","affiliation":[]},{"given":"Thomas N.","family":"Hibbard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","unstructured":"Adams, D.: A computation model with data flow sequencing. TR 117 (Ph.D. Dissertation). CS Dept., Stanford Univ., 1968"},{"key":"CR2","first-page":"17","volume":"6","author":"E. Ashcroft","year":"1970","unstructured":"Ashcroft, E., Manna, Z.: Formalization of properties of parallel programs. Machine Intelligence 6, 17?41 (1970)","journal-title":"Machine Intelligence"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/S0022-0000(75)80018-3","volume":"10","author":"E. Ashcroft","year":"1975","unstructured":"Ashcroft, E.: Proving assertions about parallel programs. J. Comput. System Sci. 10, 110?135 (1975)","journal-title":"J. Comput. System Sci."},{"key":"CR4","volume-title":"Operating systems theory","author":"E.G. Coffmann","year":"1973","unstructured":"Coffmann, E.G., Denning, P.J.: Operating systems theory. Englewood Cliffs, N.J.: Prentice-Hall 1973"},{"key":"CR5","first-page":"1","volume-title":"Programmiersprachen. Informatik-Fachberichte, Vol. 1","author":"A.B. Cremers","year":"1976","unstructured":"Cremers, A.B., Hibbard, T.N.: The semantic definition of programming languages in terms of their data spaces. In: Programmiersprachen. Informatik-Fachberichte, Vol. 1, pp. 1?11. Berlin-Heidelberg-New York: Springer 1976"},{"key":"CR6","series-title":"Lecture notes in computer science. Vol. 45","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-07854-1_182","volume-title":"Mathematical foundations of computer science","author":"A.B. Cremers","year":"1976","unstructured":"Cremers, A.B., Hibbard, T.N.: The relationship between a procedure and its data. In: Mathematical foundations of computer science, Lecture notes in computer science. Vol. 45, pp. 250?254. Berlin-Heidelberg-New York: Springer 1976"},{"key":"CR7","unstructured":"Cremers, A.B., Hibburd, T.N.: Orthogonal information structures. Proc. Conf. Theor. Comp. Sci., Univ. Waterloo, pp. 182?190, 1977"},{"key":"CR8","unstructured":"De Bakker, J.W.: Termination of nondeterministic programs. Proc. 3rd Colloq. Aut., Lang., and Progr., Edinburgh, 1976"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informat. 1, 115?138 (1971)","journal-title":"Acta Informat."},{"key":"CR10","volume-title":"A discipline of programming","author":"E.W. Dijkstra","year":"1976","unstructured":"Dijkstra, E.W.: A discipline of programming Englewood Cliffs, N.J.: Prentice-Hall 1976"},{"key":"CR11","first-page":"19","volume-title":"Proc. Symp. Applied Math., Vol.19","author":"R.W. Floyd","year":"1967","unstructured":"Floyd, R.W.: Assigning meanings to programs. Proc. Symp. Applied Math., Vol.19, Amer. Math. Soc., Provincetown, R.I., pp. 19?32 (1967)"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/363156.363160","volume":"12","author":"A.N. Habermann","year":"1969","unstructured":"Habermann, A.N.: Prevention of system deadlocks. Comm. ACM 12, 373?377 (1969)","journal-title":"Comm. ACM"},{"key":"CR13","unstructured":"Hack, M.H.: Analysis of production schemata by Petri nets. MIT Proj. MAC Rept. TR 94 (Thesis), 1972"},{"key":"CR14","unstructured":"Holt, A., Commoner, F.: Events and conditions. Rec. Proj. MAC Conf. Concur. Syst. Par. Computat., pp. 3?52, 1970"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1145\/356603.356607","volume":"4","author":"R.C. Holt","year":"1972","unstructured":"Holt, R.C.: Some deadlock properties of computer systems. Comput. Surveys 4, 179?196 (1972)","journal-title":"Comput. Surveys"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/356612.356614","volume":"5","author":"J.J. Horning","year":"1973","unstructured":"Horning, J.J., Randell, B.: Process structuring. Comput. Surveys 5, 5?30 (1973)","journal-title":"Comput. Surveys"},{"key":"CR17","unstructured":"Kahn, G.: A preliminary theory for parallel programs. IRIA Rept., No. 6, 1973"},{"key":"CR18","first-page":"993","volume-title":"Information processing 77","author":"G. Kahn","year":"1977","unstructured":"Kahn, G., McQueen, D.B.: Coroutines and networks of parallel processes. In: Information processing 77 (B. Gilchrist, ed.), pp. 993?998. Amsterdam: North-Holland 1977"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1137\/0114108","volume":"14","author":"R.M. Karp","year":"1966","unstructured":"Karp, R.M., Miller R.E.: Properties of a model for parallel computations: determinacy, termination, queueing. SIAM J. Appl. Math. 14, 1390?1411 (1966)","journal-title":"SIAM J. Appl. Math."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. System Sci. 3, 147?195 (1969)","journal-title":"J. Comput. System Sci."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321765.321782","volume":"20","author":"R.M. Keller","year":"1973","unstructured":"Keller, R.M.: Parallel program schemata and maximal parallelism. J. Assoc. Comput. Mach. 20, 514?537, 696?710 (1973)","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR22","unstructured":"Keller, R.M.: Vector replacement systems: A formalism for modeling asynchronous systems. TR 117, Comp. Sci. Lab., EE Dept., Princeton Univ., 1972, revised 1974"},{"key":"CR23","series-title":"Lecture notes in computer science, Vol. 24","volume-title":"Parallel processing","author":"R.M. Keller","year":"1975","unstructured":"Keller, R.M.: A fundamental theorem of asynchronous parallel computation. In: Parallel processing, Lecture notes in computer science, Vol. 24. Berlin-Heidelberg-New York: Springer 1975"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"R.M. Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Comm. ACM 19. 371?384 (1976)","journal-title":"Comm. ACM"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(70)90002-0","volume":"1","author":"Z. Manna","year":"1970","unstructured":"Manna, Z.: The correctness of nondeterministic programs. Artificial Intelligence 1, 1?26 (1970)","journal-title":"Artificial Intelligence"},{"key":"CR26","unstructured":"Muller, D.E., Bartky, W.S.: A theory of asynchronous circuits. Proc. Int'l. Symp. Switch. Th., pp. 204?243 (1959)"},{"key":"CR27","first-page":"310","volume":"6","author":"P. Naur","year":"1966","unstructured":"Naur, P.: Proof of algorithms by general snapshots. Nordisk Tidskr. Informationsbehandling (BIT) 6, 310?316 (1966)","journal-title":"Nordisk Tidskr. Informationsbehandling (BIT)"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Patil, S.S.: Closure properties of interconnections of determinate systems. Rec. Proj. MAC Conf. Concur. Syst. Par. Computat., pp. 107?226, 1970","DOI":"10.1038\/226107a0"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Plotkin, G.: A powerdomain construction. SIAM J. Comput. (to appear)","DOI":"10.1137\/0205035"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(76)90032-3","volume":"2","author":"B.K. Rosen","year":"1976","unstructured":"Rosen, B.K.: Correctness of parallel programs: the Church-Rosser approach. Theor. Comput. Sci. 2, 183?207 (1976)","journal-title":"Theor. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289044\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T08:00:49Z","timestamp":1585900849000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1978]]}},"alternative-id":["BF00289044"],"URL":"https:\/\/doi.org\/10.1007\/bf00289044","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}