{"id":"https://openalex.org/W4410583352","doi":"https://doi.org/10.23919/date64628.2025.10992936","title":"Exact Schedulability Analysis for Limited-Preemptive Parallel Applications Using Timed Automata in UPPAAL","display_name":"Exact Schedulability Analysis for Limited-Preemptive Parallel Applications Using Timed Automata in UPPAAL","publication_year":2025,"publication_date":"2025-03-31","ids":{"openalex":"https://openalex.org/W4410583352","doi":"https://doi.org/10.23919/date64628.2025.10992936"},"language":"en","primary_location":{"id":"doi:10.23919/date64628.2025.10992936","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date64628.2025.10992936","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.tue.nl/ws/files/361769586/Exact_Schedulability_Analysis_for_Limited-Preemptive_Parallel_Applications_Using_Timed_Automata_in_UPPAAL_1_.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058714574","display_name":"Jonas Hansen","orcid":"https://orcid.org/0000-0003-3612-4139"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Jonas Hansen","raw_affiliation_strings":["DEIS, Aalborg Universitet,Aalborg,Denmark"],"affiliations":[{"raw_affiliation_string":"DEIS, Aalborg Universitet,Aalborg,Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090385686","display_name":"Srinidhi Srinivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Srinidhi Srinivasan","raw_affiliation_strings":["IRIS, Eindhoven University of Technology,Eindhoven,The Netherlands"],"affiliations":[{"raw_affiliation_string":"IRIS, Eindhoven University of Technology,Eindhoven,The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023696057","display_name":"Geoffrey Nelissen","orcid":"https://orcid.org/0000-0003-4141-6718"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Geoffrey Nelissen","raw_affiliation_strings":["IRIS, Eindhoven University of Technology,Eindhoven,The Netherlands"],"affiliations":[{"raw_affiliation_string":"IRIS, Eindhoven University of Technology,Eindhoven,The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069362159","display_name":"Kim G. Larsen","orcid":"https://orcid.org/0000-0002-5953-3384"},"institutions":[{"id":"https://openalex.org/I891191580","display_name":"Aalborg University","ror":"https://ror.org/04m5j1k67","country_code":"DK","type":"education","lineage":["https://openalex.org/I891191580"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Kim G. Larsen","raw_affiliation_strings":["DEIS, Aalborg Universitet,Aalborg,Denmark"],"affiliations":[{"raw_affiliation_string":"DEIS, Aalborg Universitet,Aalborg,Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058714574"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09968388,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8287903070449829},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7765957713127136},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5054519176483154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.15369102358818054}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8287903070449829},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7765957713127136},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5054519176483154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.15369102358818054}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23919/date64628.2025.10992936","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date64628.2025.10992936","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 Design, Automation &amp;amp; Test in Europe Conference (DATE)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/34c1865b-2f5d-437a-9615-1ddd04a2cfb4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/34c1865b-2f5d-437a-9615-1ddd04a2cfb4","pdf_url":"https://pure.tue.nl/ws/files/361769586/Exact_Schedulability_Analysis_for_Limited-Preemptive_Parallel_Applications_Using_Timed_Automata_in_UPPAAL_1_.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen, J, Srinivasan, S, Nelissen, G & Larsen, K G 2025, Exact Schedulability Analysis for Limited-Preemptive Parallel Applications Using Timed Automata in UPPAAL. in 2025 Design, Automation and Test in Europe Conference, DATE 2025., 10992936, Institute of Electrical and Electronics Engineers, 2025 Design, Automation and Test in Europe Conference, DATE 2025, Lyon, France, 31/03/25. https://doi.org/10.23919/DATE64628.2025.10992936","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/9ddc1c1c-7089-48b7-ab9f-b66a9edb4997","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/9ddc1c1c-7089-48b7-ab9f-b66a9edb4997","pdf_url":null,"source":{"id":"https://openalex.org/S4306401731","display_name":"VBN Forskningsportal (Aalborg Universitet)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I891191580","host_organization_name":"Aalborg University","host_organization_lineage":["https://openalex.org/I891191580"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen, J, Srinivasan, S, Nelissen, G & Larsen, K G 2025, Exact Schedulability Analysis for Limited-Preemptive Parallel Applications Using Timed Automata in UPPAAL. in 2025 Design, Automation & Test in Europe Conference (DATE). IEEE (Institute of Electrical and Electronics Engineers), Proceedings of the Design, Automation, and Test in Europe Conference and Exhibition, 2025 Design, Automation & Test in Europe Conference (DATE), Lyon, France, 31/03/2025. https://doi.org/10.23919/DATE64628.2025.10992936","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/34c1865b-2f5d-437a-9615-1ddd04a2cfb4","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/34c1865b-2f5d-437a-9615-1ddd04a2cfb4","pdf_url":"https://pure.tue.nl/ws/files/361769586/Exact_Schedulability_Analysis_for_Limited-Preemptive_Parallel_Applications_Using_Timed_Automata_in_UPPAAL_1_.pdf","source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hansen, J, Srinivasan, S, Nelissen, G & Larsen, K G 2025, Exact Schedulability Analysis for Limited-Preemptive Parallel Applications Using Timed Automata in UPPAAL. in 2025 Design, Automation and Test in Europe Conference, DATE 2025., 10992936, Institute of Electrical and Electronics Engineers, 2025 Design, Automation and Test in Europe Conference, DATE 2025, Lyon, France, 31/03/25. https://doi.org/10.23919/DATE64628.2025.10992936","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410583352.pdf","grobid_xml":"https://content.openalex.org/works/W4410583352.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1625622590","https://openalex.org/W2050243060","https://openalex.org/W2101508170","https://openalex.org/W2161734639","https://openalex.org/W2163628188","https://openalex.org/W2724448295","https://openalex.org/W2755795409","https://openalex.org/W2905579395","https://openalex.org/W2917461237","https://openalex.org/W2946016889","https://openalex.org/W2972968925","https://openalex.org/W3022664842","https://openalex.org/W3181211640","https://openalex.org/W3211676493","https://openalex.org/W4382364307","https://openalex.org/W4385806742","https://openalex.org/W6766417329"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"We":[0,76],"study":[1],"the":[2,44,60,81,113],"problem":[3],"of":[4,12,32,46,62,115],"verifying":[5],"schedulability":[6,28,101],"and":[7,29,49,80,95,99,102,118],"ascertaining":[8],"response":[9,30,103],"time":[10,31,104],"bounds":[11],"limited-preemptive":[13],"parallel":[14,33,93],"applications":[15,34,94],"with":[16],"uncertainty,":[17],"scheduled":[18],"on":[19],"multi-core":[20],"platforms.":[21],"While":[22],"sufficient":[23,64,120],"techniques":[24],"exist":[25],"for":[26,111],"analysing":[27],"under":[35],"fixed-priority":[36],"scheduling,":[37],"their":[38],"accuracy":[39,114],"remains":[40],"uncertain":[41],"due":[42],"to":[43,58,86,91,129,135],"lack":[45],"a":[47,56,88,97,109],"scalable":[48,98],"exact":[50,100],"analysis":[51,121],"that":[52],"can":[53],"serve":[54],"as":[55],"ground-truth":[57],"measure":[59],"pessimism":[61],"existing":[63,117],"analyses.":[65],"In":[66],"this":[67,71],"paper,":[68],"we":[69],"address":[70],"gap":[72],"using":[73],"formal":[74],"methods.":[75],"use":[77],"Timed":[78],"Automata":[79],"powerful":[82],"UPPAAL":[83],"verification":[84],"engine":[85],"develop":[87],"generic":[89],"approach":[90],"model":[92,138],"provide":[96],"analysis.":[105],"This":[106],"work":[107],"establishes":[108],"benchmark":[110],"evaluating":[112],"both":[116],"future":[119],"techniques.":[122],"Furthermore,":[123],"our":[124],"solution":[125],"is":[126],"easily":[127],"extendable":[128],"more":[130],"complex":[131],"task":[132],"models":[133],"thanks":[134],"its":[136],"flexible":[137],"architecture.":[139]},"counts_by_year":[],"updated_date":"2026-03-17T17:19:04.345684","created_date":"2025-10-10T00:00:00"}
