{"id":"https://openalex.org/W966662723","doi":"https://doi.org/10.1007/s00165-015-0340-4","title":"Accelerating worst case execution time analysis of timed automata models with cyclic behaviour","display_name":"Accelerating worst case execution time analysis of timed automata models with cyclic behaviour","publication_year":2015,"publication_date":"2015-07-30","ids":{"openalex":"https://openalex.org/W966662723","doi":"https://doi.org/10.1007/s00165-015-0340-4","mag":"966662723"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-015-0340-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-015-0340-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-015-0340-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-015-0340-4","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103113897","display_name":"Omar I. Al-Bataineh","orcid":"https://orcid.org/0000-0003-2309-3679"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Omar Al-Bataineh","raw_affiliation_strings":["School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036930915","display_name":"Mark Reynolds","orcid":"https://orcid.org/0000-0002-5415-0544"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mark Reynolds","raw_affiliation_strings":["School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030763134","display_name":"Tim French","orcid":"https://orcid.org/0000-0002-0748-8040"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Tim French","raw_affiliation_strings":["School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Software Engineering, University of Western Australia, Perth, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103113897"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":null,"apc_paid":null,"fwci":2.5437,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.89227049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"27","issue":"5-6","first_page":"917","last_page":"949"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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.9995999932289124,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9983999729156494,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9976000189781189,"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.8660157322883606},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7609796524047852},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7343114018440247},{"id":"https://openalex.org/keywords/worst-case-execution-time","display_name":"Worst-case execution time","score":0.7171161770820618},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6798561215400696},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6309174299240112},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5389832258224487},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.44561389088630676},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.44468817114830017},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.43737637996673584},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41755789518356323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4170783460140228},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35136517882347107},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23381003737449646}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8660157322883606},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7609796524047852},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7343114018440247},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.7171161770820618},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6798561215400696},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6309174299240112},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5389832258224487},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.44561389088630676},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.44468817114830017},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.43737637996673584},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41755789518356323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4170783460140228},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35136517882347107},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23381003737449646},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-015-0340-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-015-0340-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-015-0340-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.atira.dk:publications/ed8c96ff-d3c2-4480-9049-3689eb44ca8c","is_oa":false,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/ed8c96ff-d3c2-4480-9049-3689eb44ca8c","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Al-Bataineh , O , Reynolds , M & French , T 2015 , ' Accelerating worst case execution time analysis of timed automata models with cyclic behaviour ' , FORMAL ASPECTS OF COMPUTING , vol. 27 , no. 5-6 , pp. 917-949 . https://doi.org/10.1007/s00165-015-0340-4","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s00165-015-0340-4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-015-0340-4","pdf_url":"https://dl.acm.org/doi/pdf/10.1007/s00165-015-0340-4","source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6499999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W966662723.pdf","grobid_xml":"https://content.openalex.org/works/W966662723.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W31976835","https://openalex.org/W41277334","https://openalex.org/W966662723","https://openalex.org/W1482233117","https://openalex.org/W1482438700","https://openalex.org/W1490576890","https://openalex.org/W1502289695","https://openalex.org/W1514827953","https://openalex.org/W1518454656","https://openalex.org/W1531261972","https://openalex.org/W1536744902","https://openalex.org/W1540580590","https://openalex.org/W1550288578","https://openalex.org/W1601699262","https://openalex.org/W1604429416","https://openalex.org/W1731318210","https://openalex.org/W1820192350","https://openalex.org/W1821880317","https://openalex.org/W1942011698","https://openalex.org/W1962072139","https://openalex.org/W1977308797","https://openalex.org/W2007490191","https://openalex.org/W2007572995","https://openalex.org/W2079649539","https://openalex.org/W2080593426","https://openalex.org/W2099225046","https://openalex.org/W2100271265","https://openalex.org/W2101508170","https://openalex.org/W2120006639","https://openalex.org/W2150220388","https://openalex.org/W2165951089","https://openalex.org/W2269864374","https://openalex.org/W2340735175","https://openalex.org/W2911583164","https://openalex.org/W3023191323"],"related_works":["https://openalex.org/W2020915693","https://openalex.org/W1597414920","https://openalex.org/W1970083749","https://openalex.org/W966662723","https://openalex.org/W2305635746","https://openalex.org/W2154984531","https://openalex.org/W2274428774","https://openalex.org/W2884148430","https://openalex.org/W1518566078","https://openalex.org/W2044309072"],"abstract_inverted_index":{"Abstract":[0],"The":[1,22],"paper":[2],"presents":[3],"a":[4,25,126,144],"new":[5],"efficient":[6],"algorithm":[7,23,83,109,134],"for":[8],"computing":[9],"worst":[10],"case":[11],"execution":[12],"time":[13],"(WCET)":[14],"of":[15,27,35,38,129],"systems":[16],"modelled":[17],"as":[18],"timed":[19],"automata":[20],"(TA).":[21],"uses":[24],"set":[26],"abstraction":[28],"techniques":[29],"that":[30,46,61,95,102,122],"improve":[31],"significantly":[32],"the":[33,47,55,59,62,66,72,76,85,89,137],"efficiency":[34,146],"WCET":[36,56,63],"analysis":[37],"TA":[39],"models":[40],"with":[41,52,84],"cyclic":[42],"behaviour.":[43],"We":[44,79],"show":[45],"proposed":[48],"abstractions":[49],"are":[50],"exact":[51],"respect":[53],"to":[54,71,143],"problem":[57],"in":[58,65,75,88],"sense":[60],"computed":[64,74],"abstract":[67],"model":[68,90],"is":[69],"equal":[70],"one":[73,86],"concrete":[77],"model.":[78],"also":[80],"compare":[81],"our":[82],"implemented":[87],"checker":[91],"UPPAAL":[92],"which":[93],"shows":[94],"when":[96,114],"infinite":[97],"cycles":[98,101,118,121],"exist":[99,119],"(i.e.":[100,120],"can":[103,123],"be":[104,124],"run":[105,125],"infinitely":[106],"often),":[107],"UPPAAL\u2019s":[108,133],"may":[110],"not":[111],"terminate,":[112],"and":[113],"largely":[115],"repetitive":[116],"finite":[117],"large":[127],"number":[128],"times":[130],"but":[131],"finite),":[132],"suffers":[135],"from":[136],"state":[138],"space":[139],"explosion,":[140],"thus":[141],"leading":[142],"low":[145],"or":[147],"resource":[148],"exhaustion.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}