{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:10:44Z","timestamp":1743081044561,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031294754"},{"type":"electronic","value":"9783031294761"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-29476-1_6","type":"book-chapter","created":{"date-parts":[[2023,3,24]],"date-time":"2023-03-24T11:03:45Z","timestamp":1679655825000},"page":"70-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Schedulability Analysis of Rate-Monotonic Algorithm on Concurrent Execution of Digraph Real-Time Tasks"],"prefix":"10.1007","author":[{"given":"Jin","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangliang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,25]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM (JACM) 20(1), 46\u201361 (1973)","DOI":"10.1145\/321738.321743"},{"key":"6_CR2","unstructured":"Mok, A.K.-L.: Fundamental design problems of distributed systems for the hard-real-time environment. Ph.D. thesis, Massachusetts Institute of Technology (1983)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Moyo, N.T., Nicollet, E., Lafaye, F., Moy, C.: On schedulability analysis of non-cyclic generalized multiframe tasks. In: 2010 22nd Euromicro Conference on Real-Time Systems, pp. 271\u2013278. IEEE (2010)","DOI":"10.1109\/ECRTS.2010.24"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008030427220","volume":"17","author":"S Baruah","year":"1999","unstructured":"Baruah, S., Chen, D., Gorinsky, S., Mok, A.: Generalized multiframe tasks. Real-Time Syst. 17(1), 5\u201322 (1999)","journal-title":"Real-Time Syst."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Stigge, M., Ekberg, P., Guan, N., Yi, W.: The digraph real-time task model. In: 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium, pp. 71\u201380. IEEE (2011)","DOI":"10.1109\/RTAS.2011.15"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Baruah, S.: The non-cyclic recurring real-time task model. In: 2010 31st IEEE Real-Time Systems Symposium, pp. 173\u2013182. IEEE (2010)","DOI":"10.1109\/RTSS.2010.19"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Baruah, S.K., Burns, A., Davis, R.I.: Response-time analysis for mixed criticality systems. In: 2011 IEEE 32nd Real-Time Systems Symposium, pp. 34\u201343. IEEE Computer Society (2011)","DOI":"10.1109\/RTSS.2011.12"},{"key":"6_CR8","unstructured":"Nasri, M., Nelissen, G., Brandenburg, B.B.: Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. In: 31st Conference on Real-Time Systems, pp. 21\u20131 (2019)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Bini, E., Buttazzo, G.C.: Schedulability analysis of periodic fixed priority systems. IEEE Trans. Comput. 53(11), 1462\u20131473 (2004)","DOI":"10.1109\/TC.2004.103"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Anssi, S., Tucci-Piergiovanni, S., Kuntz, S., G\u00e9rard, S., Terrier, F.: Enabling scheduling analysis for AUTOSAR systems. In: 2011 14th IEEE International Symposium on Object\/Component\/Service-Oriented Real-Time Distributed Computing, pp. 152\u2013159. IEEE (2011)","DOI":"10.1109\/ISORC.2011.28"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Cui, J., Duan, Z., Tian, C.: Model checking rate-monotonic scheduler with TMSVL. In: 2014 19th International Conference on Engineering of Complex Computer Systems, pp. 202\u2013205. IEEE (2014)","DOI":"10.1109\/ICECCS.2014.37"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Cui, J., Cong, T., et al.: Verifying schedulability of tasks in ROS-based systems. J. Comb. Optim. 37, 901\u2013920 (2019)","DOI":"10.1007\/s10878-018-0328-0"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Cui, J., Duan, Z., et al.: A novel approach to modeling and verifying real-time systems for high reliability. IEEE Trans. Reliab. 67(2), 481\u2013493 (2018)","DOI":"10.1109\/TR.2018.2806349"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Lehoczky, J., Sha, L., Ding, Y.: The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: RTSS, vol. 89, pp. 166\u2013171 (1989)","DOI":"10.1109\/REAL.1989.63567"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Baruah, S.K.: Dynamic-and static-priority scheduling of recurring real-time tasks. Real-Time Syst. 24(1), 93\u2013128 (2003)","DOI":"10.1023\/A:1021711220939"},{"issue":"6","key":"6_CR16","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.: Combinatorial abstraction refinement for feasibility analysis of static priorities. Real-Time Syst. 51(6), 639\u2013674 (2015)","journal-title":"Real-Time Syst."}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29476-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T23:38:07Z","timestamp":1729121887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29476-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031294754","9783031294761"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29476-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFL+MSVL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Structured Object-Oriented Formal Language and Method","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofl2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"26","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":"12","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":"46% - 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":"2","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy to use as a whole. Almost everything in the system is good.","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)"}}]}}