{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T14:22:26Z","timestamp":1790432546566,"version":"4.1.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>\n            Hybrid systems modelers like Simulink come with a rich collection of discrete-time and continuous-time blocks. Most blocks are not defined in terms of more elementary ones\u2014and some cannot be\u2014but are instead written in imperative code and explained informally in a reference manual. This raises the question of defining a minimal set of orthogonal programming constructs such that most blocks can be\n            <jats:italic>programmed<\/jats:italic>\n            directly and thereby given a specification that is mathematically precise, and whose compiled version performs comparably to handwritten code.\n          <\/jats:p>\n          <jats:p>In this paper, we show that a fairly large set of blocks of a standard library like the one provided by Simulink can be programmed in a precise, purely functional language using stream equations, hierarchical automata, Ordinary Differential Equations (ODEs), and deterministic synchronous parallel composition. Some blocks cannot be expressed in our setting as they mix discrete-time and continuous-time signals in unprincipled ways that are statically forbidden by the type checker.<\/jats:p>\n          <jats:p>\n            The experiment is conducted in Z\u00e9lus, a synchronous language that conservatively extends L\n            <jats:sc>ustre<\/jats:sc>\n            with ODEs to program systems that mix discrete-time and continuous-time signals.\n          <\/jats:p>","DOI":"10.1145\/3126516","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["A Synchronous Look at the Simulink Standard Library"],"prefix":"10.1145","volume":"16","author":[{"given":"Timothy","family":"Bourke","sequence":"first","affiliation":[{"name":"INRIA Paris and \u00c9cole normale sup\u00e9rieure, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Francois","family":"Carcenac","sequence":"additional","affiliation":[{"name":"INRIA Paris and \u00c9cole normale sup\u00e9rieure, Paris, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Louis","family":"Cola\u00e7o","sequence":"additional","affiliation":[{"name":"ANSYS\/Esterel-Technologies, Toulouse, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bruno","family":"Pagano","sequence":"additional","affiliation":[{"name":"ANSYS\/Esterel-Technologies, Toulouse, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9dric","family":"Pasteur","sequence":"additional","affiliation":[{"name":"ANSYS\/Esterel-Technologies, Toulouse, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marc","family":"Pouzet","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Pierre et Marie Curie, \u00c9cole normale sup\u00e9rieure, and INRIA Paris"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038642.2038685"},{"key":"e_1_2_1_2_1","volume-title":"Murray","author":"\u00c5str\u00f6m Karl J.","year":"2008","unstructured":"Karl J. \u00c5str\u00f6m and Richard M . Murray . 2008 . Feedback Systems : An Introduction for Scientists and Engineers. Princeton University Press , NJ, USA. Karl J. \u00c5str\u00f6m and Richard M. Murray. 2008. Feedback Systems: An Introduction for Scientists and Engineers. Princeton University Press, NJ, USA."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2562059.2562125"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2038642.2038664"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1967677.1967687"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.08.009"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2002.805826"},{"key":"e_1_2_1_8_1","first-page":"11","article-title":"Real time programming: Special purpose or general purpose languages","volume":"89","author":"Berry G\u00e9rard","year":"1989","unstructured":"G\u00e9rard Berry . 1989 . Real time programming: Special purpose or general purpose languages . Information Processing 89 (1989), 11 -- 17 . G\u00e9rard Berry. 1989. Real time programming: Special purpose or general purpose languages. Information Processing 89 (1989), 11--17.","journal-title":"Information Processing"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2248418.2248437"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46663-6_4"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461328.2461348"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0160-y"},{"key":"e_1_2_1_14_1","first-page":"2","article-title":"A modified regula falsi method for computing the root of an equation","volume":"11","author":"Dowell M.","year":"1972","unstructured":"M. Dowell and P. Jarratt . 1972 . A modified regula falsi method for computing the root of an equation . BIT Numerical Mathematics 11 , 2 (June 1972), 168--174. M. Dowell and P. Jarratt. 1972. A modified regula falsi method for computing the root of an equation. BIT Numerical Mathematics 11, 2 (June 1972), 168--174.","journal-title":"BIT Numerical Mathematics"},{"key":"e_1_2_1_15_1","volume-title":"Technologies SAS","author":"Esterel","year":"2016","unstructured":"Esterel Technologies SAS 2016 . Gateway Guidelines for Simulink. Esterel Technologies SAS. Esterel Technologies SAS 2016. Gateway Guidelines for Simulink. Esterel Technologies SAS."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(90)90035-N"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2248418.2248426"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.97300"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086228.1086260"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24721-0_17"},{"key":"e_1_2_1_21_1","volume-title":"Hindmarsh and Radu Serban","author":"Alan","year":"2016","unstructured":"Alan C. Hindmarsh and Radu Serban . 2016 . User Documentation for cvode v2.9.0 (v2.9.0 ed.). Lawrence Livermore National Laboratory, Livermore, CA, USA. Alan C. Hindmarsh and Radu Serban. 2016. User Documentation for cvode v2.9.0 (v2.9.0 ed.). Lawrence Livermore National Laboratory, Livermore, CA, USA."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31954-2_2"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the REX Workshop Real-Time: Theory in Practice (Lecture Notes in Computer Science)","volume":"600","author":"Maler Oded","year":"1992","unstructured":"Oded Maler , Zouar Manna , and Amir Pnueli . 1992 . From Timed to Hybrid Systems . In Proceedings of the REX Workshop Real-Time: Theory in Practice (Lecture Notes in Computer Science) , Vol. 600 . Springer, Mook, The Netherlands, 447--484. Oded Maler, Zouar Manna, and Amir Pnueli. 1992. From Timed to Hybrid Systems. In Proceedings of the REX Workshop Real-Time: Theory in Practice (Lecture Notes in Computer Science), Vol. 600. Springer, Mook, The Netherlands, 447--484."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1186\/1687-3963-2007-059130"},{"key":"e_1_2_1_25_1","volume-title":"Handbook of Floating-Point Arithmetic","author":"Muller Jean-Michel","unstructured":"Jean-Michel Muller , Nicolas Brisebarre , Florent de Dinechin , Claude-Pierre Jeannerod , Vincent Lef\u00e8vre , Guillaume Melquiond , Nathalie Revol , Damien Stehl\u00e9 , and Serge Torres . 2010. Handbook of Floating-Point Arithmetic . Birkh\u00e4user , Basel, Switzerland . Jean-Michel Muller, Nicolas Brisebarre, Florent de Dinechin, Claude-Pierre Jeannerod, Vincent Lef\u00e8vre, Guillaume Melquiond, Nathalie Revol, Damien Stehl\u00e9, and Serge Torres. 2010. Handbook of Floating-Point Arithmetic. Birkh\u00e4user, Basel, Switzerland."},{"key":"e_1_2_1_26_1","volume-title":"Types and Programming Languages","author":"Pierce B. C.","unstructured":"B. C. Pierce . 2002. Types and Programming Languages . MIT Press , Cambridge, MA, USA . B. C. Pierce. 2002. Types and Programming Languages. MIT Press, Cambridge, MA, USA."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429120"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1113830.1113834"},{"key":"e_1_2_1_29_1","volume-title":"Lee","author":"Tripakis Stavros","year":"2013","unstructured":"Stavros Tripakis , Christos Stergiou , Chris Shaver , and Edward A . Lee . 2013 . A modular formal semantics for Ptolemy. Mathematical Structures in Computer Science 23, 4 (008 2013), 834--881. Stavros Tripakis, Christos Stergiou, Chris Shaver, and Edward A. Lee. 2013. A modular formal semantics for Ptolemy. Mathematical Structures in Computer Science 23, 4 (008 2013), 834--881."}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126516","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:01Z","timestamp":1750273501000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":28,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3126516"],"URL":"https:\/\/doi.org\/10.1145\/3126516","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,27]]},"assertion":[{"value":"2017-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}