{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:36:24Z","timestamp":1743028584363,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030134341"},{"type":"electronic","value":"9783030134358"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-13435-8_2","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:18:36Z","timestamp":1550071116000},"page":"31-42","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Observation and Interaction"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5663-0584","authenticated-orcid":false,"given":"Edward A.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"key":"2_CR1","series-title":"IFIPAICT","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-0-387-35082-0_10","volume-title":"Formal Methods for Open Object-based Distributed Systems","author":"GA Agha","year":"1997","unstructured":"Agha, G.A.: Abstracting interaction patterns: a programming paradigm for open distributed systems. In: Najm, E., Stefani, J.B. (eds.) Formal Methods for Open Object-based Distributed Systems. IFIPAICT, pp. 135\u2013153. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/978-0-387-35082-0_10"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Babai, L.: Trading group theory for randomness. In: Symposium on Theory of Computing (STOC), pp. 421\u2013429. ACM (1985). \n                      https:\/\/doi.org\/10.1145\/22145.22192","DOI":"10.1145\/22145.22192"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/EE.1934.6540374","volume":"53","author":"HS Black","year":"1934","unstructured":"Black, H.S.: Stabilized feed-back amplifiers. Electr. Eng. 53, 114\u2013120 (1934)","journal-title":"Electr. Eng."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ic.2004.07.002","volume":"194","author":"D Goldin","year":"2004","unstructured":"Goldin, D., Smolka, S., Attie, P., Sonderegger, E.: Turing machines, transition systems, and interaction. Inf. Comput. 194(2), 101\u2013128 (2004)","journal-title":"Inf. Comput."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems (extended abstract). In: Symposium on Theory of Computing (STOC), pp. 291\u2013304. ACM (1985)","DOI":"10.1145\/22145.22178"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989). \n                      https:\/\/doi.org\/10.1137\/0218012","journal-title":"SIAM J. Comput."},{"key":"2_CR7","unstructured":"Lee, E.A., Seshia, S.A.: Introduction to Embedded Systems - A Cyber-Physical Systems Approach, Second edn. MIT Press, Cambridge (2017). \n                      http:\/\/LeeSeshia.org"},{"key":"2_CR8","unstructured":"Lee, E.A.: Living Digital Beings \u2013 A New Life Form on Our Planet? MIT Press, Cambridge (2020, to appear)"},{"key":"2_CR9","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/151233.151240","volume":"36","author":"R Milner","year":"1993","unstructured":"Milner, R.: Elements of interaction. Commun. ACM 36, 78\u201389 (1993)","journal-title":"Commun. ACM"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167\u2013183. Springer, Heidelberg (1981). \n                      https:\/\/doi.org\/10.1007\/BFb0017309"},{"key":"2_CR12","volume-title":"Causality: Models, Reasoning, and Inference","author":"J Pearl","year":"2000","unstructured":"Pearl, J.: Causality: Models, Reasoning, and Inference, 2nd edn. Cambridge University Press, Cambridge (2000). (2009)","edition":"2"},{"key":"2_CR13","volume-title":"The Book of Why: The New Science of Cause and Effect","author":"J Pearl","year":"2018","unstructured":"Pearl, J., Mackenzie, D.: The Book of Why: The New Science of Cause and Effect. Basic Books, New York (2018)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/0-387-34805-0_60","volume-title":"Advances in Cryptology \u2014 CRYPTO 89 Proceedings","author":"J-J Quisquater","year":"1990","unstructured":"Quisquater, J.-J., et al.: How to explain zero-knowledge protocols to your children. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 628\u2013631. Springer, New York (1990). \n                      https:\/\/doi.org\/10.1007\/0-387-34805-0_60"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/1516507.1516510","volume":"31","author":"D Sangiorgi","year":"2009","unstructured":"Sangiorgi, D.: On the origins of bisimulation and coinduction. ACM Trans. Program. Lang. Syst. 31(4), 15:1\u201315:41 (2009). \n                      https:\/\/doi.org\/10.1145\/1516507.1516510\n                      \n                    . Article 15, Pub. date: May 2009","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR16","series-title":"IFIPAICT","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-0-387-35082-0_11","volume-title":"Formal Methods for Open Object-Based Distributed Systems (FMOODS)","author":"CL Talcott","year":"1996","unstructured":"Talcott, C.L.: Interaction semantics for components of distributed systems. In: Najm, E., Stefani, J.B. (eds.) Formal Methods for Open Object-Based Distributed Systems (FMOODS). IFIPAICT, pp. 154\u2013169. Springer, Heidelberg (1996). \n                      https:\/\/doi.org\/10.1007\/978-0-387-35082-0_11"},{"issue":"1","key":"2_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1207\/S15327078IN0101_02","volume":"1","author":"E Thelen","year":"2000","unstructured":"Thelen, E.: Grounded in the world: developmental origins of the embodied mind. Infancy 1(1), 3\u201328 (2000)","journal-title":"Infancy"},{"issue":"5","key":"2_CR18","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/253769.253801","volume":"40","author":"P Wegner","year":"1997","unstructured":"Wegner, P.: Why interaction is more powerful than algorithms. Commun. ACM 40(5), 80\u201391 (1997). \n                      https:\/\/doi.org\/10.1145\/253769.253801","journal-title":"Commun. ACM"},{"key":"2_CR19","unstructured":"Wiener, N.: Cybernetics: Or Control and Communication in the Animal and the Machine. Librairie Hermann & Cie, Paris, and MIT Press, Cambridge (1948)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13435-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:48:09Z","timestamp":1558478889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-13435-8_2"}},"subtitle":["Invited Paper"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030134341","9783030134358"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13435-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lata2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"6-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}