{"id":"https://openalex.org/W2125797251","doi":"https://doi.org/10.1145/2185632.2185647","title":"Optimal scheduling for constant-rate multi-mode systems","display_name":"Optimal scheduling for constant-rate multi-mode systems","publication_year":2012,"publication_date":"2012-04-17","ids":{"openalex":"https://openalex.org/W2125797251","doi":"https://doi.org/10.1145/2185632.2185647","mag":"2125797251"},"language":"en","primary_location":{"id":"doi:10.1145/2185632.2185647","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2185632.2185647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065059795","display_name":"Rajeev Alur","orcid":"https://orcid.org/0000-0003-1733-7083"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rajeev Alur","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020302140","display_name":"Ashutosh Trivedi","orcid":"https://orcid.org/0000-0001-9346-0126"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashutosh Trivedi","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001234060","display_name":"Dominik Wojtczak","orcid":"https://orcid.org/0000-0001-5560-0546"},"institutions":[{"id":"https://openalex.org/I922845939","display_name":"Philadelphia University","ror":"https://ror.org/03zzmyz63","country_code":"US","type":"education","lineage":["https://openalex.org/I922845939"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dominik Wojtczak","raw_affiliation_strings":["University of Liverpool, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Liverpool, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I922845939"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065059795"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":3.1098,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.91993391,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"75","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7707898020744324},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7160823345184326},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6310784220695496},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4453476667404175},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44370871782302856},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4306556284427643},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4192362129688263},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.41689425706863403},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39408186078071594},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.327218234539032},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2269371747970581},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1855306625366211},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18037915229797363},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.07361477613449097}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7707898020744324},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7160823345184326},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6310784220695496},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4453476667404175},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44370871782302856},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4306556284427643},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4192362129688263},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.41689425706863403},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39408186078071594},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.327218234539032},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2269371747970581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1855306625366211},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18037915229797363},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.07361477613449097},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2185632.2185647","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2185632.2185647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.946","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~alur/Hscc12.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8899999856948853}],"awards":[{"id":"https://openalex.org/G1151799532","display_name":null,"funder_award_id":"EP/G050112/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G6414529594","display_name":null,"funder_award_id":"EP/G050112/2","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W412460","https://openalex.org/W1569998753","https://openalex.org/W1573865009","https://openalex.org/W1843383196","https://openalex.org/W1983026649","https://openalex.org/W1987234253","https://openalex.org/W1991276146","https://openalex.org/W2057842062","https://openalex.org/W2085838366","https://openalex.org/W2101508170","https://openalex.org/W2117863556","https://openalex.org/W2126320473","https://openalex.org/W2127784312","https://openalex.org/W2140595448","https://openalex.org/W2144040052","https://openalex.org/W2150646259","https://openalex.org/W2160032004","https://openalex.org/W2170091282","https://openalex.org/W2170917304","https://openalex.org/W2186500120","https://openalex.org/W2331053933"],"related_works":["https://openalex.org/W2141183298","https://openalex.org/W2315923944","https://openalex.org/W1970063378","https://openalex.org/W2327776271","https://openalex.org/W961142965","https://openalex.org/W1968954131","https://openalex.org/W2082636129","https://openalex.org/W1521364045","https://openalex.org/W2075449032","https://openalex.org/W2982557863"],"abstract_inverted_index":{"Constant-rate":[0],"multi-mode":[1],"systems":[2,5,37],"are":[3,116],"hybrid":[4],"that":[6,44,60,104],"can":[7,62,112],"switch":[8,113],"freely":[9],"among":[10],"a":[11,22,41,49,110,149,155],"finite":[12,23],"set":[13],"of":[14,25,56,96,148],"modes,":[15,129],"and":[16,80,138],"whose":[17],"dynamics":[18],"is":[19,38,59,103],"specified":[20,50,117],"by":[21,118,124],"number":[24],"real-valued":[26],"variables":[27],"with":[28,77,128,132],"mode-dependent":[29],"constant":[30],"rates.":[31],"The":[32,53,99],"schedulability":[33,61,75,157],"problem":[34],"for":[35,94],"such":[36],"to":[39,73,101,136,142,154],"design":[40,95],"mode-switching":[42],"policy":[43],"maintains":[45],"the":[46,57,105,114,140],"state":[47],"within":[48],"safety":[51],"set.":[52],"main":[54],"result":[55,72],"paper":[58],"be":[63],"decided":[64],"in":[65],"polynomial":[66],"time.":[67],"We":[68],"also":[69],"generalize":[70],"our":[71],"optimal":[74],"problems":[76],"average":[78],"cost":[79,82],"reachability":[81],"objectives.":[83,120],"Polynomial-time":[84],"scheduling":[85],"algorithms":[86],"make":[87,143],"this":[88],"class":[89],"an":[90],"appealing":[91],"formal":[92],"model":[93],"energy-optimal":[97],"policies.":[98],"key":[100],"tractability":[102],"only":[106,145],"constraints":[107,123],"on":[108],"when":[109],"scheduler":[111,141],"mode":[115,133],"global":[119],"Adding":[121],"local":[122],"associating":[125],"either":[126],"invariants":[127],"or":[130],"guards":[131],"switches,":[134],"lead":[135],"undecidability,":[137],"requiring":[139],"decisions":[144],"at":[146],"multiples":[147],"given":[150],"sampling":[151],"rate,":[152],"leads":[153],"PSPACE-complete":[156],"problem.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
