{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T21:01:04Z","timestamp":1751662864851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319191942"},{"type":"electronic","value":"9783319191959"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19195-9_9","type":"book-chapter","created":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T06:28:41Z","timestamp":1430807321000},"page":"131-145","source":"Crossref","is-referenced-by-count":3,"title":["Timely Dataflow: A Model"],"prefix":"10.1007","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Isard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-662-46666-7_5","volume-title":"Principles of Security and Trust","author":"M. Abadi","year":"2015","unstructured":"Abadi, M., Isard, M.: On the flow of data, information, and time. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol.\u00a09036, pp. 73\u201392. Springer, Heidelberg (2015)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-17524-9_3","volume-title":"NASA Formal Methods","author":"M. Abadi","year":"2015","unstructured":"Abadi, M., Isard, M.: Timely rollback: Specification and verification. In: Havelund, K., Holzmann, G., Joshi, R. (eds.) NFM 2015. LNCS, vol.\u00a09058, pp. 19\u201334. Springer, Heidelberg (2015)"},{"issue":"2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science\u00a082(2), 253\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/978-3-642-38592-6_2","volume-title":"Formal Techniques for Distributed Systems","author":"M. Abadi","year":"2013","unstructured":"Abadi, M., McSherry, F., Murray, D.G., Rodeheffer, T.L.: Formal analysis of a distributed algorithm for tracking progress. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE 2013. LNCS, vol.\u00a07892, pp. 5\u201319. Springer, Heidelberg (2013)"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/227234.227246","volume":"39","author":"G.E. Blelloch","year":"1996","unstructured":"Blelloch, G.E.: Programming parallel algorithms. Communications of the ACM\u00a039(3), 85\u201397 (1996)","journal-title":"Communications of the ACM"},{"issue":"5","key":"9_CR6","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1017\/S0960129504004293","volume":"14","author":"T.T. Hildebrandt","year":"2004","unstructured":"Hildebrandt, T.T., Panangaden, P., Winskel, G.: A relational model of non-deterministic dataflow. Mathematical Structures in Computer Science\u00a014(5), 613\u2013649 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"3","key":"9_CR7","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/3916.3988","volume":"7","author":"D.R. Jefferson","year":"1985","unstructured":"Jefferson, D.R.: Virtual time. ACM Transactions on Programming Languages and Systems\u00a07(3), 404\u2013425 (1985)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9_CR8","series-title":"LNBI","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-11712-1_2","volume-title":"Transactions on Computational Systems Biology XII","author":"M. John","year":"2010","unstructured":"John, M., Lhoussaine, C., Niehren, J., Uhrmacher, A.M.: The attributed pi-calculus with priorities. In: Priami, C., Breitling, R., Gilbert, D., Heiner, M., Uhrmacher, A.M. (eds.) Transactions on Computational Systems Biology XII. LNCS (LNBI), vol.\u00a05945, pp. 13\u201376. Springer, Heidelberg (2010)"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BF02280834","volume":"7","author":"B. Jonsson","year":"1994","unstructured":"Jonsson, B.: A fully abstract trace model for dataflow and asynchronous networks. Distributed Computing\u00a07(4), 197\u2013212 (1994)","journal-title":"Distributed Computing"},{"key":"9_CR10","unstructured":"Kahn, G.: The semantics of a simple language for parallel programming. In: IFIP Congress, pp. 471\u2013475 (1974)"},{"key":"9_CR11","unstructured":"Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware and Software Engineers. Addison-Wesley (2002)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Murray, D.G., McSherry, F., Isaacs, R., Isard, M., Barham, P., Abadi, M.: Naiad: a timely dataflow system. In: ACM SIGOPS 24th Symposium on Operating Systems Principles, pp. 439\u2013455 (2013)","DOI":"10.1145\/2517349.2522738"},{"issue":"1","key":"9_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01379149","volume":"15","author":"V. Pratt","year":"1986","unstructured":"Pratt, V.: Modeling concurrency with partial orders. International Journal of Parallel Programming\u00a015(1), 33\u201371 (1986)","journal-title":"International Journal of Parallel Programming"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/3-540-63141-0_26","volume-title":"CONCUR\u201997: Concurrency Theory","author":"P. Selinger","year":"1997","unstructured":"Selinger, P.: First-order axioms for asynchrony. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 376\u2013390. Springer, Heidelberg (1997)"},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1017\/S0960129509990168","volume":"19","author":"C. Versari","year":"2009","unstructured":"Versari, C., Busi, N., Gorrieri, R.: An expressiveness study of priority in process calculi. Mathematical Structures in Computer Science\u00a019(6), 1161\u20131189 (2009)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19195-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T19:41:17Z","timestamp":1559158877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-19195-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319191942","9783319191959"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19195-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}