{"id":"https://openalex.org/W1987734880","doi":"https://doi.org/10.1145/1059816.1059823","title":"Optimal scheduling using priced timed automata","display_name":"Optimal scheduling using priced timed automata","publication_year":2005,"publication_date":"2005-03-01","ids":{"openalex":"https://openalex.org/W1987734880","doi":"https://doi.org/10.1145/1059816.1059823","mag":"1987734880"},"language":"en","primary_location":{"id":"doi:10.1145/1059816.1059823","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1059816.1059823","pdf_url":null,"source":{"id":"https://openalex.org/S4210187660","display_name":"ACM SIGMETRICS Performance Evaluation Review","issn_l":"0163-5999","issn":["0163-5999","1557-9484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMETRICS Performance Evaluation Review","raw_type":"journal-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/A5108532510","display_name":"Gerd Behrmann","orcid":null},"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":"Gerd Behrmann","raw_affiliation_strings":["","Aalborg Univ., , Denmark"],"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"Aalborg Univ., , Denmark","institution_ids":["https://openalex.org/I891191580"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069362159","display_name":"Kim G. Larsen","orcid":"https://orcid.org/0000-0002-5953-3384"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim G. Larsen","raw_affiliation_strings":[""],"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108537359","display_name":"Jacob Illum Rasmussen","orcid":null},"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":"Jacob I. Rasmussen","raw_affiliation_strings":["Aalborg University, Denmark"],"affiliations":[{"raw_affiliation_string":"Aalborg University, Denmark","institution_ids":["https://openalex.org/I891191580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108532510"],"corresponding_institution_ids":["https://openalex.org/I891191580"],"apc_list":null,"apc_paid":null,"fwci":7.7425,"has_fulltext":false,"cited_by_count":139,"citation_normalized_percentile":{"value":0.98118641,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"32","issue":"4","first_page":"34","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9959999918937683,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/reachability","display_name":"Reachability","score":0.8969603776931763},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.8534953594207764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.817854642868042},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6425047516822815},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4699324071407318},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45063984394073486},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32709774374961853},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.3251670002937317},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2368825376033783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08837750554084778}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8969603776931763},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.8534953594207764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.817854642868042},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6425047516822815},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4699324071407318},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45063984394073486},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32709774374961853},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.3251670002937317},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2368825376033783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08837750554084778}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1059816.1059823","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1059816.1059823","pdf_url":null,"source":{"id":"https://openalex.org/S4210187660","display_name":"ACM SIGMETRICS Performance Evaluation Review","issn_l":"0163-5999","issn":["0163-5999","1557-9484"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMETRICS Performance Evaluation Review","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/6ff56ce0-add7-11da-983a-000ea68e967b","is_oa":false,"landing_page_url":"https://vbn.aau.dk/da/publications/6ff56ce0-add7-11da-983a-000ea68e967b","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":"Behrmann, G, Larsen, K G & Rasmussen, J I 2005, 'Optimal scheduling using priced timed automata', SIGMETRICS Performance Evaluation Review - Measurement and Evaluation, vol. 32, no. 4, pp. 34-40.","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.49000000953674316,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1483079125","https://openalex.org/W1489067204","https://openalex.org/W1573865009","https://openalex.org/W1820192350","https://openalex.org/W1878516677","https://openalex.org/W1886297056","https://openalex.org/W1962072139","https://openalex.org/W2000947342","https://openalex.org/W2065323166","https://openalex.org/W2101508170","https://openalex.org/W2106614985","https://openalex.org/W2115006640","https://openalex.org/W2130664212","https://openalex.org/W2140595448","https://openalex.org/W2142718416","https://openalex.org/W2170907279","https://openalex.org/W2602645338","https://openalex.org/W2903935047","https://openalex.org/W4285719527","https://openalex.org/W6639360369"],"related_works":["https://openalex.org/W2130664212","https://openalex.org/W1750171350","https://openalex.org/W4382045631","https://openalex.org/W2032445854","https://openalex.org/W2095644384","https://openalex.org/W1903000972","https://openalex.org/W1571606103","https://openalex.org/W2148140319","https://openalex.org/W1565729639","https://openalex.org/W1554767603"],"abstract_inverted_index":{"This":[0],"contribution":[1],"reports":[2],"on":[3],"the":[4,26,42,54,63,75],"considerable":[5],"effort":[6,24],"made":[7],"recently":[8,55],"towards":[9],"extending":[10],"and":[11,20,47,50],"applying":[12],"well-established":[13],"timed":[14,81],"automata":[15],"technology":[16],"to":[17,32],"optimal":[18],"scheduling":[19],"planning":[21],"problems.":[22],"The":[23],"of":[25,41,62,78],"authors":[27],"in":[28,53],"this":[29],"direction":[30],"has":[31],"a":[33,60],"large":[34],"extent":[35],"been":[36],"carried":[37],"out":[38],"as":[39],"part":[40],"European":[43],"projects":[44],"VHS":[45],"[20]":[46],"AMETIST":[48],"[16]":[49],"are":[51],"available":[52],"released":[56],"UPPAAL":[57,67],"CORA":[58],"[12],":[59],"variant":[61],"real-time":[64],"verification":[65],"tool":[66],"[18,":[68],"5]":[69],"specialized":[70],"for":[71,74],"cost-optimal":[72],"reachability":[73],"extended":[76],"model":[77],"so-called":[79],"priced":[80],"automata.":[82]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}