{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T06:49:35Z","timestamp":1778914175224,"version":"3.51.4"},"reference-count":31,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T00:00:00Z","timestamp":1495584000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2018,6]]},"abstract":"<jats:p>We present an algebra of discrete timed input\/output automata that may execute in the context of different clock granularities \u2013 which we call timed machines; this algebra includes a refinement operator through which a machine can be extended with new states and transitions in order to accommodate a finer clock granularity as required to interoperate with other machines, and an extension of the traditional product of timed input\u2013output automata to the situation in which the granularities of the two machines are not the same. Over this algebra, we then define an algebra of networks of timed machines that includes operations through which networks can be modified at run time, thus offering a model for systems of interconnected components that can dynamically bind to other systems and, therefore, cannot be adjusted at design time to ensure that they operate in a timed homogeneous setting. We investigate important properties of timed machines such as consistency \u2013 in the sense that a machine can be ensured to generate a non-empty language, and feasibility \u2013 in the sense that a machine can be ensured to generate a non-empty language no matter what inputs it receives, and propose techniques for checking if timed machines are consistent or are feasible. We generalise those properties to networks of timed machines, and investigate how consistency and feasibility of networks can be proved through properties that can be checked at design time without having to compute, at run time, the product of the machines that operate on those networks, which would not be practical.<\/jats:p>","DOI":"10.1017\/s0960129517000135","type":"journal-article","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T05:45:51Z","timestamp":1495604751000},"page":"800-855","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic networks of heterogeneous timed machines"],"prefix":"10.1017","volume":"28","author":[{"given":"JOS\u00c9","family":"FIADEIRO","sequence":"first","affiliation":[]},{"given":"ANT\u00d3NIA","family":"LOPES","sequence":"additional","affiliation":[]},{"given":"BENO\u00ceT","family":"DELAHAYE","sequence":"additional","affiliation":[]},{"given":"AXEL","family":"LEGAY","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"S0960129517000135_ref28","first-page":"204","volume-title":"ESOCC Workshops","author":"Le","year":"2013"},{"key":"S0960129517000135_ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.819898"},{"key":"S0960129517000135_ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2007.400"},{"key":"S0960129517000135_ref25","volume-title":"System Design with SystemC","author":"Gr\u00f6tker","year":"2002"},{"key":"S0960129517000135_ref24","first-page":"93","volume-title":"EMSOFT","author":"G\u00f6\u00dfler","year":"2002"},{"key":"S0960129517000135_ref22","first-page":"251","volume-title":"HASE","author":"Forget","year":"2008"},{"key":"S0960129517000135_ref21","first-page":"404","volume-title":"CONCUR","author":"Fisher","year":"2011"},{"key":"S0960129517000135_ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.12.014","article-title":"Heterogeneous and asynchronous networks of timed systems","volume":"663","author":"Fiadeiro","year":"2017","journal-title":"Theoretical Computer Science"},{"key":"S0960129517000135_ref16","first-page":"115","volume-title":"ICTAC","author":"Delahaye","year":"2014"},{"key":"S0960129517000135_ref15","first-page":"242","volume-title":"FORTE","author":"Delahaye","year":"2013"},{"key":"S0960129517000135_ref12","unstructured":"Chauchat P. (2015). Asynchronous relational networks. Rapport de M2, Universit\u00e9 Paris 7 \u2013 Denis-Diderot."},{"key":"S0960129517000135_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-014-4096-4"},{"key":"S0960129517000135_ref10","first-page":"155","article-title":"Ptolemy: A framework for simulating and prototyping heterogenous systems","volume":"4","author":"Buck","year":"1994","journal-title":"International Journal in Computer Simulation"},{"key":"S0960129517000135_ref14","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/1755952.1755967","volume-title":"HSCC","author":"David","year":"2010"},{"key":"S0960129517000135_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0091-5"},{"key":"S0960129517000135_ref17","first-page":"70","volume-title":"ECSA","author":"Fiadeiro","year":"2010"},{"key":"S0960129517000135_ref6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/1086228.1086276","volume-title":"EMSOFT","author":"Benveniste","year":"2005"},{"key":"S0960129517000135_ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MS.2011.27"},{"key":"S0960129517000135_ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-010-0166-z"},{"key":"S0960129517000135_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.01.048"},{"key":"S0960129517000135_ref2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008739929481"},{"key":"S0960129517000135_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.05.011"},{"key":"S0960129517000135_ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1289927.1289949"},{"key":"S0960129517000135_ref26","first-page":"226","volume-title":"REX Workshop","author":"Henzinger","year":"1991"},{"key":"S0960129517000135_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-010-9094-5"},{"key":"S0960129517000135_ref3","doi-asserted-by":"crossref","unstructured":"Attie P.C. and Lynch N.A. (2001). Dynamic input\/output automata: A formal model for dynamic systems. In: Proceedings of the CONCUR 2001 \u2013 Concurrency Theory, 12th International Conference, Aalborg, Denmark, 137\u2013151.","DOI":"10.1145\/383962.384051"},{"key":"S0960129517000135_ref8","doi-asserted-by":"crossref","unstructured":"Bozga M. , Jaber M. , Maris N. and Sifakis J. (2012). Modeling dynamic architectures using dy-BIP. In: Proceedings of the 11th International Conference on Software Composition, SC'12, Berlin, Heidelberg: Springer-Verlag, 1\u201316.","DOI":"10.1007\/978-3-642-30564-1_1"},{"key":"S0960129517000135_ref27","doi-asserted-by":"crossref","DOI":"10.2200\/S00006ED1V01Y200508CSL001","volume-title":"The Theory of Timed I\/O Automata","author":"Kaynar","year":"2006"},{"key":"S0960129517000135_ref4","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.ic.2016.03.008","article-title":"Dynamic input\/output automata: A formal and compositional model for dynamic systems","volume":"249","author":"Attie","year":"2016","journal-title":"Information and Computation"},{"key":"S0960129517000135_ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90224-P"},{"key":"S0960129517000135_ref7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.3233\/FI-2009-0043","article-title":"Modelling of complex systems: Systems as dataflow machines","volume":"91","author":"Bliudze","year":"2009","journal-title":"Fundamenta Informaticae"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129517000135","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T10:18:21Z","timestamp":1602152301000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129517000135\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,24]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["S0960129517000135"],"URL":"https:\/\/doi.org\/10.1017\/s0960129517000135","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,24]]}}}