{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:25:21Z","timestamp":1767338721162,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030452308"},{"type":"electronic","value":"9783030452315"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We extend the signal flow calculus\u2014a compositional account of the classical signal flow graph model of computation\u2014to encompass affine behaviour, and furnish it with a novel operational semantics. The increased expressive power allows us to define a canonical notion of contextual equivalence, which we show to coincide with denotational equality. Finally, we characterise the realisable fragment of the calculus: those terms that express the computations of (affine) signal flow graphs.<\/jats:p>","DOI":"10.1007\/978-3-030-45231-5_5","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T10:02:53Z","timestamp":1587117773000},"page":"77-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Contextual Equivalence for Signal Flow Graphs"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robin","family":"Piedeleu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"5_CR1","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS), 2004. pp. 415\u2013425. IEEE (2004)"},{"key":"5_CR2","unstructured":"Baez, J., Erbele, J.: Categories in control. Theory and Applications of Categories 30, 836\u2013881 (2015)"},{"key":"5_CR3","unstructured":"Baez, J.C.: Network theory (2014), http:\/\/math.ucr.edu\/home\/baez\/networks\/, website (retrieved 15\/04\/2014)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Basold, H., Bonsangue, M., Hansen, H., Rutten, J.: (Co)Algebraic characterizations of signal flow graphs. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds.) Horizons of the Mind. A Tribute to Prakash Panangaden, Lecture Notes in Computer Science, vol. 8464, pp. 124\u2013145. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-06880-0_6"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Holland, J., Piedeleu, R., Soboci\u0144ski, P., Zanasi, F.: Diagrammatic algebra: from linear to concurrent systems. Proceedings of the 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL) 3, 1\u201328 (2019)","DOI":"10.1145\/3290338"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Piedeleu, R., Soboci\u0144ski, P., Zanasi, F.: Graphical affine algebra. In: Proceedings of the 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). pp. 1\u201312 (2019)","DOI":"10.1109\/LICS.2019.8785877"},{"key":"5_CR7","unstructured":"Bonchi, F., Piedeleu, R., Soboci\u0144ski, P., Zanasi, F.: Contextual equivalence for signal flow graphs (2020), https:\/\/arxiv.org\/abs\/2002.08874"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Soboci\u0144ski, P., Zanasi, F.: A categorical semantics of signal flow graphs. In: Proceedings of the 25th International Conference on Concurrency Theory (CONCUR). pp. 435\u2013450. Springer (2014)","DOI":"10.1007\/978-3-662-44584-6_30"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Sobocinski, P., Zanasi, F.: Full abstraction for signal flow graphs. In: Proceedings of the 42nd Annual ACM SIGPLAN Symposium on Principles of Programming Languages (POPL). pp. 515\u2013526 (2015)","DOI":"10.1145\/2676726.2676993"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Sobocinski, P., Zanasi, F.: The calculus of signal flow diagrams I: linear relations on streams. Information and Computation 252, 2\u201329 (2017)","DOI":"10.1016\/j.ic.2016.03.002"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Coecke, B., Duncan, R.: Interacting quantum observables. In: Proceedings of the 35th international colloquium on Automata, Languages and Programming (ICALP), Part II. pp. 298\u2013310 (2008)","DOI":"10.1007\/978-3-540-70583-3_25"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Coecke, B., Kissinger, A.: Picturing Quantum Processes - A first course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press (2017)","DOI":"10.1017\/9781316219317"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Hennessy, M.C.: Testing equivalences for processes. Theoretical Computer Science 34(1-2), 83\u2013133 (1984)","DOI":"10.1016\/0304-3975(84)90113-0"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Ghica, D.R.: Diagrammatic reasoning for delay-insensitive asynchronous circuits. In: Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky, pp. 52\u201368. Springer (2013)","DOI":"10.1007\/978-3-642-38164-5_5"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Jung, A.: Categorical semantics of digital circuits. In: Proceedings of the 16th Conference on Formal Methods in Computer-Aided Design (FMCAD). pp. 41\u201348 (2016)","DOI":"10.1109\/FMCAD.2016.7886659"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Ghica, D.R., Lopez, A.: A structural and nominal syntax for diagrams. In: Proceedings 14th International Conference on Quantum Physics and Logic (QPL). pp. 71\u201383 (2017)","DOI":"10.4204\/EPTCS.266.4"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall (1985)","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. Theoretical Computer Science 152(2), 437\u2013486 (1995)","DOI":"10.1016\/0304-3975(95)00074-7"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Mac Lane, S.: Categorical algebra. Bulletin of the American Mathematical Society 71, 40\u2013106 (1965)","DOI":"10.1090\/S0002-9904-1965-11234-4"},{"key":"5_CR20","unstructured":"Mac\u00a0Lane, S.: Categories for the Working Mathematician. Springer (1998)"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Mason, S.J.: Feedback Theory: I. Some Properties of Signal Flow Graphs. MIT Research Laboratory of Electronics (1953)","DOI":"10.1109\/JRPROC.1953.274449"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Milius, S.: A sound and complete calculus for finite stream circuits. In: Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science (LICS). pp. 421\u2013430 (2010)","DOI":"10.1109\/LICS.2010.11"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Milner, R.: A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92. Springer (1980)","DOI":"10.1007\/3-540-10235-3"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP). pp. 685\u2013695 (1992)","DOI":"10.1007\/3-540-55719-9_114"},{"key":"5_CR25","unstructured":"Morris Jr, J.H.: Lambda-calculus models of programming languages. Ph.D. thesis, Massachusetts Institute of Technology (1969)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Pavlovic, D.: Monoidal computer I: Basic computability by string diagrams. Information and Computation 226, 94\u2013116 (2013)","DOI":"10.1016\/j.ic.2013.03.007"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Pavlovic, D.: Monoidal computer II: Normal complexity by string diagrams. arXiv:1402.5687 (2014)","DOI":"10.1016\/j.ic.2013.03.007"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the $$\\lambda $$-calculus. Theoretical Computer Science 1(2), 125\u2013159 (1975)","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Rutten, J.J.M.M.: A tutorial on coinductive stream calculus and signal flow graphs. Theoretical Computer Science 343(3), 443\u2013481 (2005)","DOI":"10.1016\/j.tcs.2005.06.019"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Rutten, J.J.M.M.: Rational streams coalgebraically. Logical Methods in Computer Science 4(3) (2008)","DOI":"10.2168\/LMCS-4(3:9)2008"},{"key":"5_CR31","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. Springer Lecture Notes in Physics 13(813), 289\u2013355 (2011)"},{"key":"5_CR32","unstructured":"Shannon, C.E.: The theory and design of linear differential equation machines. Tech. rep., National Defence Research Council (1942)"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Willems, J.C.: The behavioural approach to open and interconnected systems. IEEE Control Systems Magazine 27, 46\u201399 (2007)","DOI":"10.1109\/MCS.2007.4339280"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45231-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T15:46:47Z","timestamp":1666367207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45231-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452308","9783030452315"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45231-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/fossacs","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference could not take place due to the COVID-19 pandemic. There was an online event on July 2, 2020.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}