{"id":"https://openalex.org/W2029996376","doi":"https://doi.org/10.1016/s1571-0661(04)80883-1","title":"Analysis of Scheduling Behaviour using Generic Timed Automata","display_name":"Analysis of Scheduling Behaviour using Generic Timed Automata","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2029996376","doi":"https://doi.org/10.1016/s1571-0661(04)80883-1","mag":"2029996376"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80883-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80883-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80883-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048211705","display_name":"Thorsten Gerdsmeier","orcid":null},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Thorsten Gerdsmeier","raw_affiliation_strings":["Department of Computer Science, University of Essex, Colchester CO4 3SQ, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Essex, Colchester CO4 3SQ, United Kingdom","institution_ids":["https://openalex.org/I110002522"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037889355","display_name":"Rachel Cardell\u2010Oliver","orcid":"https://orcid.org/0000-0003-0590-1003"},"institutions":[{"id":"https://openalex.org/I110002522","display_name":"University of Essex","ror":"https://ror.org/02nkf1q06","country_code":"GB","type":"education","lineage":["https://openalex.org/I110002522"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Rachel Cardell-Oliver","raw_affiliation_strings":["Department of Computer Science, University of Essex, Colchester CO4 3SQ, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Essex, Colchester CO4 3SQ, United Kingdom","institution_ids":["https://openalex.org/I110002522"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048211705","https://openalex.org/A5037889355"],"corresponding_institution_ids":["https://openalex.org/I110002522"],"apc_list":null,"apc_paid":null,"fwci":0.26643888,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.58505435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"42","issue":null,"first_page":"143","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9987999796867371,"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.9955000281333923,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8873915076255798},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.6348071098327637},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6255797147750854},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6019818186759949},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5673601031303406},{"id":"https://openalex.org/keywords/uniprocessor-system","display_name":"Uniprocessor system","score":0.5317902565002441},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5161217451095581},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.49419859051704407},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.48558729887008667},{"id":"https://openalex.org/keywords/priority-inversion","display_name":"Priority inversion","score":0.4453860819339752},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.44409385323524475},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4315722584724426},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3586239218711853},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3370174765586853},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2818205952644348},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25872689485549927},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.13154208660125732},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11818024516105652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.06939321756362915}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8873915076255798},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.6348071098327637},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6255797147750854},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6019818186759949},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5673601031303406},{"id":"https://openalex.org/C79189994","wikidata":"https://www.wikidata.org/wiki/Q3488021","display_name":"Uniprocessor system","level":3,"score":0.5317902565002441},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5161217451095581},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.49419859051704407},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48558729887008667},{"id":"https://openalex.org/C172828308","wikidata":"https://www.wikidata.org/wiki/Q520734","display_name":"Priority inversion","level":5,"score":0.4453860819339752},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.44409385323524475},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4315722584724426},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3586239218711853},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3370174765586853},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2818205952644348},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25872689485549927},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.13154208660125732},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11818024516105652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06939321756362915},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(04)80883-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80883-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80883-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80883-1","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W55601588","https://openalex.org/W1524254874","https://openalex.org/W1550099218","https://openalex.org/W1711245081","https://openalex.org/W2000947342","https://openalex.org/W2066403336","https://openalex.org/W2101508170","https://openalex.org/W2109488193","https://openalex.org/W2116093754","https://openalex.org/W2153269726","https://openalex.org/W2262960161","https://openalex.org/W4248605921","https://openalex.org/W6602246582","https://openalex.org/W6829736813"],"related_works":["https://openalex.org/W2172075652","https://openalex.org/W56912691","https://openalex.org/W1712986213","https://openalex.org/W4381889969","https://openalex.org/W2888222534","https://openalex.org/W2110186189","https://openalex.org/W1840932120","https://openalex.org/W140492576","https://openalex.org/W3163801625","https://openalex.org/W2001066483"],"abstract_inverted_index":{"A":[0],"method":[1],"for":[2,34,85,95],"dynamic,":[3],"automated":[4],"analysis":[5],"of":[6,9,38,43,114],"the":[7,52,99,106,112],"behaviour":[8,113],"real-time":[10],"programs":[11],"under":[12,122],"different":[13],"scheduling":[14,19,62,97,124],"algorithms":[15],"is":[16,21],"presented.":[17],"Each":[18],"algorithm":[20,109],"defined":[22],"by":[23],"a":[24,35,115],"generic":[25,93],"timed":[26,45],"automaton":[27],"which":[28],"can":[29,47,64],"be":[30,48,66],"instantiated":[31,44],"with":[32],"data":[33,71],"particular":[36],"set":[37],"tasks.":[39],"The":[40],"resulting":[41],"network":[42],"automata":[46],"analysed":[49],"automatically":[50],"in":[51,120],"model-checker":[53],"Uppaal,":[54],"to":[55],"ensure":[56],"correctness":[57],"properties":[58],"are":[59],"satisfied.":[60],"Various":[61],"metrics":[63],"also":[65],"calculated.":[67],"We":[68],"assume":[69],"that":[70],"such":[72],"as":[73],"worst":[74],"case":[75],"execution":[76],"times,":[77],"periods,":[78],"deadlines":[79],"and":[80,105,110],"priorities":[81],"have":[82],"been":[83],"pre-calculated":[84],"each":[86,123],"task.":[87],"In":[88],"this":[89],"paper":[90],"we":[91],"present":[92],"specifications":[94],"uniprocessor":[96],"using":[98],"immediate":[100],"ceiling":[101],"priority":[102],"protocol":[103],"(ICPP)":[104],"earliest-deadline-first":[107],"(EDF)":[108],"analyse":[111],"mine":[116],"pump":[117],"controller":[118],"implemented":[119],"Ada95":[121],"algorithm.":[125]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}