{"id":"https://openalex.org/W1969831112","doi":"https://doi.org/10.1109/etfa.2014.7005207","title":"Simple bounds on deadline failure probabilities in fault-tolerant real-time networks","display_name":"Simple bounds on deadline failure probabilities in fault-tolerant real-time networks","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W1969831112","doi":"https://doi.org/10.1109/etfa.2014.7005207","mag":"1969831112"},"language":"en","primary_location":{"id":"doi:10.1109/etfa.2014.7005207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2014.7005207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5016807947","display_name":"Michael Short","orcid":"https://orcid.org/0000-0001-6290-4396"},"institutions":[{"id":"https://openalex.org/I874055015","display_name":"Teesside University","ror":"https://ror.org/03z28gk75","country_code":"GB","type":"education","lineage":["https://openalex.org/I874055015"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Michael Short","raw_affiliation_strings":["Electronics & Control Group, Teesside University, Middlesbrough, UK","SCEDT Engineering"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electronics & Control Group, Teesside University, Middlesbrough, UK","institution_ids":["https://openalex.org/I874055015"]},{"raw_affiliation_string":"SCEDT Engineering","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016807947"],"corresponding_institution_ids":["https://openalex.org/I874055015"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"46","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.9998999834060669,"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.9998999834060669,"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.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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.814889669418335},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7252756357192993},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6989524960517883},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5526988506317139},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5357818603515625},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.5035731196403503},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.4605481028556824},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.42698925733566284},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.42375561594963074},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4209524393081665},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32674792408943176},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.27299031615257263},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.23559117317199707},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.16820907592773438},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1428438127040863},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08814224600791931}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.814889669418335},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7252756357192993},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6989524960517883},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5526988506317139},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5357818603515625},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.5035731196403503},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.4605481028556824},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.42698925733566284},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.42375561594963074},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4209524393081665},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32674792408943176},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.27299031615257263},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.23559117317199707},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.16820907592773438},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1428438127040863},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08814224600791931},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/etfa.2014.7005207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa.2014.7005207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA)","raw_type":"proceedings-article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire_cris_publications/03c3ae0f-66da-4fe6-bcfc-34934e1f08f9","is_oa":false,"landing_page_url":"https://research.tees.ac.uk/en/publications/03c3ae0f-66da-4fe6-bcfc-34934e1f08f9","pdf_url":null,"source":{"id":"https://openalex.org/S4306402475","display_name":"Teesside University Research Portal (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Short , M 2014 , ' Simple bounds on deadline failure probabilities in fault-tolerant real-time networks. ' , IEEE International Conference on Emerging Technologies and Factory Automation, ETFA , pp. 1-7 . https://doi.org/10.1109/ETFA.2014.7005207","raw_type":"article"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire_cris_publications/adbc83b1-dac9-40e8-8db9-70b8d86f98f0","is_oa":false,"landing_page_url":"https://research.tees.ac.uk/en/publications/adbc83b1-dac9-40e8-8db9-70b8d86f98f0","pdf_url":null,"source":{"id":"https://openalex.org/S4306402475","display_name":"Teesside University Research Portal (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Short, M 2015, Simple bounds on deadline failure probabilities for fault-tolerant real-time networks. in Proceedings of the 2014 IEEE Emerging Technology and Factory Automation (ETFA). IEEE, 19th IEEE International Conference on Emerging Technologies & Factory Automation, Barcelona, Spain, 16/09/14. https://doi.org/10.1109/ETFA.2014.7005207","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:tees.openrepository.com:10149/553038","is_oa":false,"landing_page_url":"http://hdl.handle.net/10149/553038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Meetings and Proceedings"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320325528","display_name":"Universitat de les Illes Balears","ror":"https://ror.org/03e10x626"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1523509419","https://openalex.org/W1576380096","https://openalex.org/W1935947664","https://openalex.org/W1998567144","https://openalex.org/W2004759812","https://openalex.org/W2006023091","https://openalex.org/W2036286775","https://openalex.org/W2055949768","https://openalex.org/W2057399436","https://openalex.org/W2063142364","https://openalex.org/W2086674724","https://openalex.org/W2097274529","https://openalex.org/W2103012681","https://openalex.org/W2105995702","https://openalex.org/W2118062057","https://openalex.org/W2121342001","https://openalex.org/W2122976544","https://openalex.org/W2126878009","https://openalex.org/W2137784941","https://openalex.org/W2150217546","https://openalex.org/W2154098538","https://openalex.org/W2432517183","https://openalex.org/W2484338577","https://openalex.org/W2796837256","https://openalex.org/W4233413206","https://openalex.org/W4239322463","https://openalex.org/W4242346029","https://openalex.org/W4246142437","https://openalex.org/W4247633573"],"related_works":["https://openalex.org/W830096938","https://openalex.org/W2374555443","https://openalex.org/W2393789493","https://openalex.org/W2109606716","https://openalex.org/W2367142822","https://openalex.org/W2030292806","https://openalex.org/W2189202191","https://openalex.org/W2352790745","https://openalex.org/W2177346860","https://openalex.org/W1603360336"],"abstract_inverted_index":{"Real-time":[0],"communication":[1],"networks":[2],"are":[3,56],"often":[4,37],"required":[5],"to":[6,16,29,58,69,111,121,132,150],"operate":[7],"reliably":[8],"in":[9],"harsh":[10],"environments":[11],"which":[12],"expose":[13],"the":[14,39,72,113,134,145],"system":[15],"random":[17,32,99],"errors.":[18,104],"Although":[19,139],"probabilistic":[20,52],"schedulability":[21,54],"analysis":[22,43,55],"can":[23],"employ":[24],"rich":[25],"stochastic":[26],"error":[27],"models":[28],"capture":[30],"these":[31],"behaviors,":[33],"this":[34,46],"is":[35,94,108,143,147],"most":[36],"at":[38],"expense":[40],"of":[41,63,103,124,153],"increased":[42],"complexity.":[44],"In":[45],"paper,":[47],"some":[48],"recent":[49],"results":[50],"on":[51],"real-time":[53,79],"extended":[57],"propose":[59],"an":[60],"efficient":[61],"method":[62],"time":[64],"complexity":[65],"O(n":[66],"log":[67],"n)":[68],"tightly":[70],"bound":[71],"deadline":[73],"failure":[74],"probability":[75],"for":[76],"a":[77,116,125],"fault-tolerant":[78],"network":[80],"transmitting":[81],"n":[82],"periodic/sporadic":[83],"messages.":[84],"The":[85],"paper":[86],"assumes":[87],"Earliest":[88],"Deadline":[89],"First":[90],"(EDF)":[91],"message":[92,141],"scheduling":[93,123,142],"employed":[95],"and":[96,101,115],"considers":[97],"both":[98],"errors":[100],"bursts":[102],"A":[105],"simple":[106],"example":[107,119],"first":[109],"used":[110],"illustrate":[112],"technique,":[114],"more":[117],"realistic":[118],"related":[120],"EDF":[122,140],"Controller":[126],"Area":[127],"Network":[128],"(CAN)":[129],"then":[130],"helps":[131],"show":[133],"technique":[135,146],"has":[136],"practical":[137],"value.":[138],"assumed,":[144],"readily":[148],"adaptable":[149],"other":[151],"forms":[152],"scheduling.":[154]},"counts_by_year":[{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}