{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:50:16Z","timestamp":1740124216241,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"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":["Real-Time Syst"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s11241-019-09331-1","type":"journal-article","created":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:24:35Z","timestamp":1551399875000},"page":"598-638","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs"],"prefix":"10.1007","volume":"55","author":[{"given":"Chao","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1162-759X","authenticated-orcid":false,"given":"Haibo","family":"Zeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco Di","family":"Natale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,1]]},"reference":[{"key":"9331_CR1","volume-title":"Synchronization and linearity: an algebra for discrete event systems","author":"F Baccelli","year":"1992","unstructured":"Baccelli F, Cohen G, Olsder GJ, Quadrat JP (1992) Synchronization and linearity: an algebra for discrete event systems. Wiley, Hoboken"},{"issue":"1","key":"9331_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1021711220939","volume":"24","author":"SK Baruah","year":"2003","unstructured":"Baruah SK (2003) Dynamic-and static-priority scheduling of recurring real-time tasks. Real Time Syst 24(1):93\u2013128","journal-title":"Real Time Syst"},{"key":"9331_CR3","doi-asserted-by":"crossref","unstructured":"Di\u00a0Natale M, Zeng H (2012) Task implementation of synchronous finite state machines. In: Proceedings of the conference on design, automation, and test in Europe, pp 206\u2013211","DOI":"10.1109\/DATE.2012.6176464"},{"key":"9331_CR4","unstructured":"Esterel Technologies (2014) The Trusted Design Chain Company: scade suite. \n                    http:\/\/www.esterel-technologies.com\/products\/scade-system\/"},{"issue":"8","key":"9331_CR5","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1016\/j.ic.2007.01.009","volume":"205","author":"E Fersman","year":"2007","unstructured":"Fersman E, Krcal P, Pettersson P, Yi W (2007) Task automata: schedulability, decidability and undecidability. Int J Inf Comput 205(8):1149\u20131172","journal-title":"Int J Inf Comput"},{"issue":"6","key":"9331_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd RW (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"issue":"1","key":"9331_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0024-3795(00)00020-3","volume":"307","author":"M Gavalec","year":"2000","unstructured":"Gavalec M (2000) Linear matrix period in max-plus algebra. Linear Algebra Appl 307(1):167\u2013182","journal-title":"Linear Algebra Appl"},{"key":"9331_CR8","doi-asserted-by":"crossref","unstructured":"Guan N, Gu C, Stigge M, Deng Q, Yi W (2014) Approximate response time analysis of real-time task graphs. In: IEEE real-time systems symposium (RTSS), pp 304\u2013313","DOI":"10.1109\/RTSS.2014.20"},{"issue":"3","key":"9331_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0167-6423(87)90035-9","volume":"8","author":"D Harel","year":"1987","unstructured":"Harel D (1987) Statecharts: a visual formalism for complex systems. Sci Comput Program 8(3):231\u2013274","journal-title":"Sci Comput Program"},{"issue":"2","key":"9331_CR10","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.24.2.414","volume":"24","author":"M Hartmann","year":"1999","unstructured":"Hartmann M, Arguelles C (1999) Transience bounds for long walks. Math Oper Res 24(2):414\u2013439","journal-title":"Math Oper Res"},{"key":"9331_CR11","volume-title":"Structure and interpretation of signals and systems","author":"EA Lee","year":"2011","unstructured":"Lee EA, Varaiya P (2011) Structure and interpretation of signals and systems. Addison Wesley, Boston"},{"key":"9331_CR12","doi-asserted-by":"crossref","unstructured":"Lehoczky JP (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: 11th IEEE real-time systems symposium, vol\u00a090, pp 201\u2013209","DOI":"10.1109\/REAL.1990.128748"},{"key":"9331_CR13","unstructured":"Mathworks (1994) The mathworks simulink and stateflow user\u2019s manuals. \n                    http:\/\/www.mathworks.com"},{"key":"9331_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.laa.2005.02.033","volume":"404","author":"M Moln\u00e1rov\u00e1","year":"2005","unstructured":"Moln\u00e1rov\u00e1 M (2005) Generalized matrix period in max-plus algebra. Linear Algebra Appl 404:345\u2013366","journal-title":"Linear Algebra Appl"},{"issue":"4","key":"9331_CR15","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TII.2010.2072511","volume":"6","author":"MD Natale","year":"2010","unstructured":"Natale MD, Guo L, Zeng H, Sangiovanni-Vincentelli A (2010) Synthesis of multi-task implementations of simulink models with minimum delays. IEEE Trans Ind Inf 6(4):637\u2013651","journal-title":"IEEE Trans Ind Inf"},{"key":"9331_CR16","doi-asserted-by":"crossref","unstructured":"Norstr\u00f6m C, Wall A, Yi W (1999) Timed automata as task models for event-driven systems. In: sixth international conference on real-time computing systems and applications, pp 182\u2013189","DOI":"10.1109\/RTCSA.1999.811218"},{"issue":"1","key":"9331_CR17","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s11241-017-9290-7","volume":"54","author":"C Peng","year":"2018","unstructured":"Peng C, Zeng H (2018) Response time analysis of digraph real-time tasks scheduled with static priority: generalization, approximation, and improvement. Real Time Syst 54(1):91\u2013131","journal-title":"Real Time Syst"},{"key":"9331_CR18","doi-asserted-by":"crossref","unstructured":"Stigge M, Ekberg P, Guan N, Yi W (2011) The digraph real-time task model. In: 16th IEEE real-time and embedded technology and applications symposium, pp 71\u201380","DOI":"10.1109\/RTAS.2011.15"},{"key":"9331_CR19","doi-asserted-by":"crossref","unstructured":"Stigge M, Yi W (2012) Hardness results for static priority real-time scheduling. In: 24th Euromicro conference on real-time systems (ECRTS), pp 189\u2013198","DOI":"10.1109\/ECRTS.2012.13"},{"key":"9331_CR20","doi-asserted-by":"crossref","unstructured":"Stigge M, Yi W (2013) Combinatorial abstraction refinement for feasibility analysis. In: 34th IEEE real-time systems symposium (RTSS), pp 340\u2013349","DOI":"10.1109\/RTSS.2013.41"},{"issue":"6","key":"9331_CR21","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/s11241-015-9220-5","volume":"51","author":"M Stigge","year":"2015","unstructured":"Stigge M, Yi W (2015) Combinatorial abstraction refinement for feasibility analysis of static priorities. Real Time Syst 51(6):639\u2013674","journal-title":"Real Time Syst"},{"issue":"5","key":"9331_CR22","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1007\/s11241-015-9234-z","volume":"51","author":"M Stigge","year":"2015","unstructured":"Stigge M, Yi W (2015) Graph-based models for real-time workload: a survey. Real Time Syst 51(5):602\u2013636","journal-title":"Real Time Syst"},{"key":"9331_CR23","unstructured":"Tindell K (1994) Adding time-offsets to schedulability analysis. In: Department of Computer Science, University of York, Report No. YCS-94-221"},{"issue":"3","key":"9331_CR24","doi-asserted-by":"publisher","first-page":"36:1","DOI":"10.1145\/1347375.1347389","volume":"7","author":"R Wilhelm","year":"2008","unstructured":"Wilhelm R, Engblom J, Ermedahl A, Holsti N, Thesing S, Whalley D, Bernat G, Ferdinand C, Heckmann R, Mitra T, Mueller F, Puaut I, Puschner P, Staschulat J, Stenstr\u00f6m P (2008) The worst-case execution-time problem: overview of methods and survey of tools. ACM Trans Embed Comput Syst 7(3):36:1\u201336:53","journal-title":"ACM Trans Embed Comput Syst"},{"issue":"2","key":"9331_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"NE Young","year":"1991","unstructured":"Young NE, Tarjant RE, Orlin JB (1991) Faster parametric shortest path and minimum-balance algorithms. Networks 21(2):205\u2013221","journal-title":"Networks"},{"key":"9331_CR26","doi-asserted-by":"crossref","unstructured":"Zeng H, Di Natale M (2011) Mechanisms for guaranteeing data consistency and flow preservation in autosar software on multi-core platforms. In: 6th IEEE international symposium on industrial and embedded systems, pp 140\u2013149","DOI":"10.1109\/SIES.2011.5953656"},{"key":"9331_CR27","doi-asserted-by":"crossref","unstructured":"Zeng H, Di\u00a0Natale M (2013) Using max-plus algebra to improve the analysis of non-cyclic task models. In: 25th Euromicro conference on real-time systems (ECRTS), pp 205\u2013214","DOI":"10.1109\/ECRTS.2013.30"},{"issue":"4","key":"9331_CR28","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/s11241-014-9209-5","volume":"51","author":"H Zeng","year":"2015","unstructured":"Zeng H, Di Natale M (2015) Computing periodic request functions to speed-up the analysis of non-cyclic task models. Real Time Syst 51(4):360\u2013394","journal-title":"Real Time Syst"},{"key":"9331_CR29","doi-asserted-by":"crossref","unstructured":"Zeng H, Natale MD (2012) Schedulability analysis of periodic tasks implementing synchronous finite state machines. In: 24th Euromicro conference on real-time systems (ECRTS), pp 353\u2013362","DOI":"10.1109\/ECRTS.2012.30"},{"issue":"5s","key":"9331_CR30","doi-asserted-by":"publisher","first-page":"175:1","DOI":"10.1145\/3126515","volume":"16","author":"Y Zhao","year":"2017","unstructured":"Zhao Y, Peng C, Zeng H, Gu Z (2017) Optimization of real-time software implementing multi-rate synchronous finite state machines. ACM Trans Embed Comput Syst 16(5s):175:1\u2013175:21","journal-title":"ACM Trans Embed Comput Syst"},{"key":"9331_CR31","doi-asserted-by":"crossref","unstructured":"Zhu Q, Deng P, Di\u00a0Natale M, Zeng H (2013) Robust and extensible task implementations of synchronous finite state machines. In: Design, automation test in Europe conference exhibition (DATE), pp 1319\u20131324","DOI":"10.7873\/DATE.2013.272"}],"container-title":["Real-Time Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-019-09331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11241-019-09331-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11241-019-09331-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,28]],"date-time":"2020-02-28T19:26:02Z","timestamp":1582917962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11241-019-09331-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,1]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["9331"],"URL":"https:\/\/doi.org\/10.1007\/s11241-019-09331-1","relation":{},"ISSN":["0922-6443","1573-1383"],"issn-type":[{"type":"print","value":"0922-6443"},{"type":"electronic","value":"1573-1383"}],"subject":[],"published":{"date-parts":[[2019,3,1]]},"assertion":[{"value":"1 March 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}