{"id":"https://openalex.org/W2057873236","doi":"https://doi.org/10.1007/s001650300007","title":"Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol","display_name":"Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol","publication_year":2003,"publication_date":"2003-04-01","ids":{"openalex":"https://openalex.org/W2057873236","doi":"https://doi.org/10.1007/s001650300007","mag":"2057873236"},"language":"en","primary_location":{"id":"doi:10.1007/s001650300007","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s001650300007","pdf_url":null,"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":null,"license_id":null,"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":"green","oa_url":"https://www.openaccessrepository.it/record/159226","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081710233","display_name":"Marta Kwiatkowska","orcid":"https://orcid.org/0000-0001-9022-7599"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Marta Kwiatkowska","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, UK, , , , , , GB"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK, , , , , , GB","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067544120","display_name":"Gethin Norman","orcid":"https://orcid.org/0000-0001-9326-4344"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Gethin Norman","raw_affiliation_strings":["School of Computer Science, University of Birmingham, Birmingham, UK, , , , , , GB"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Birmingham, Birmingham, UK, , , , , , GB","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044285570","display_name":"Jeremy Sproston","orcid":"https://orcid.org/0000-0003-2101-6821"},"institutions":[{"id":"https://openalex.org/I55143463","display_name":"University of Turin","ror":"https://ror.org/048tbm396","country_code":"IT","type":"education","lineage":["https://openalex.org/I55143463"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Jeremy Sproston","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Torino, Torino, Italy, , , , , , IT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Torino, Torino, Italy, , , , , , IT","institution_ids":["https://openalex.org/I55143463"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081710233"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":10.191,"has_fulltext":false,"cited_by_count":95,"citation_normalized_percentile":{"value":0.98580122,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"295","last_page":"318"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9997000098228455,"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.9965000152587891,"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/T11424","display_name":"Security and Verification in Computing","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7922518253326416},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7623798847198486},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6817219853401184},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.6572282314300537},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.649600088596344},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5766348838806152},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5660588145256042},{"id":"https://openalex.org/keywords/probabilistic-automaton","display_name":"Probabilistic automaton","score":0.551368236541748},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.46788662672042847},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.4401066303253174},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3715977370738983},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3595101833343506},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.32620561122894287},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0993199348449707}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7922518253326416},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7623798847198486},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6817219853401184},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.6572282314300537},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.649600088596344},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5766348838806152},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5660588145256042},{"id":"https://openalex.org/C174784677","wikidata":"https://www.wikidata.org/wiki/Q176567","display_name":"Probabilistic automaton","level":3,"score":0.551368236541748},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.46788662672042847},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4401066303253174},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3715977370738983},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3595101833343506},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.32620561122894287},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0993199348449707},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":6,"locations":[{"id":"doi:10.1007/s001650300007","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s001650300007","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.26.1237","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.1237","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~mzk/realtime/firewire_abs.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.28.9063","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.9063","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~mzk/realtime/firew_subm.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.4696","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/~dxp/papers/fac.ps.gz","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/67da317b-5f0e-4d05-8ce5-b0b8aee9ddd0","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/67da317b-5f0e-4d05-8ce5-b0b8aee9ddd0","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kwiatkowska, M, Norman, G & Sproston, J 2003, 'Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol', Formal Aspects of Computing, vol. 14, pp. 295-318. https://doi.org/10.1007/s001650300007","raw_type":"article"},{"id":"pmh:oai:zenodo.org:159226","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/159226","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:159226","is_oa":true,"landing_page_url":"https://www.openaccessrepository.it/record/159226","pdf_url":null,"source":{"id":"https://openalex.org/S4306402478","display_name":"INFM-OAR (INFN Catania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210116497","host_organization_name":"Istituto Nazionale di Fisica Nucleare, Sezione di Catania","host_organization_lineage":["https://openalex.org/I4210116497"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5099999904632568,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W106209860","https://openalex.org/W138290785","https://openalex.org/W1501731334","https://openalex.org/W1516849933","https://openalex.org/W1538639190","https://openalex.org/W1545761035","https://openalex.org/W1546222822","https://openalex.org/W1546631539","https://openalex.org/W1559321056","https://openalex.org/W1561934984","https://openalex.org/W1572777470","https://openalex.org/W1575144383","https://openalex.org/W1583191255","https://openalex.org/W1596186423","https://openalex.org/W1607065182","https://openalex.org/W1793726001","https://openalex.org/W1829884141","https://openalex.org/W1830600668","https://openalex.org/W1850900101","https://openalex.org/W1874725288","https://openalex.org/W1903000972","https://openalex.org/W1904695764","https://openalex.org/W2000947342","https://openalex.org/W2005998857","https://openalex.org/W2009280542","https://openalex.org/W2009491602","https://openalex.org/W2020293036","https://openalex.org/W2024355065","https://openalex.org/W2051580064","https://openalex.org/W2060095702","https://openalex.org/W2091188761","https://openalex.org/W2100271265","https://openalex.org/W2101508170","https://openalex.org/W2107193555","https://openalex.org/W2132266737","https://openalex.org/W2134991157","https://openalex.org/W2136545402","https://openalex.org/W2165161585","https://openalex.org/W2499382624","https://openalex.org/W2621174614","https://openalex.org/W2977679477","https://openalex.org/W3043060850","https://openalex.org/W4230164823","https://openalex.org/W4242441073","https://openalex.org/W4254031789","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W278680301","https://openalex.org/W2130664212","https://openalex.org/W1554767603","https://openalex.org/W1565729639","https://openalex.org/W4382045631","https://openalex.org/W2144996318","https://openalex.org/W2130642229","https://openalex.org/W2746280673","https://openalex.org/W1594593035"],"abstract_inverted_index":{"Abstract.":[0],"The":[1],"interplay":[2],"of":[3,13,26,39,121],"real":[4],"time":[5],"and":[6,82,110,118],"probability":[7],"is":[8,93,124],"crucial":[9],"to":[10,79,113],"the":[11,14,27,36,40,55,60,84,115,119],"correctness":[12],"IEEE":[15],"1394":[16],"FireWire":[17],"root":[18],"contention":[19],"protocol.":[20],"We":[21,102],"present":[22],"a":[23,48,67,91,96,99],"formal":[24],"verification":[25],"protocol":[28,85],"using":[29],"probabilistic":[30],"model":[31,81],"checking.":[32],"Rather":[33],"than":[34],"analyse":[35],"functional":[37],"aspects":[38],"protocol,":[41],"by":[42,58],"asking":[43,59],"such":[44,105],"questions":[45],"as":[46,106],"\u2018Will":[47],"leader":[49,68,92],"be":[50,70],"elected?\u2019,":[51],"we":[52,65],"focus":[53],"on":[54],"protocol's":[56],"performance,":[57],"question":[61],"\u2018How":[62],"certain":[63,100],"are":[64,77],"that":[66,90],"will":[69],"elected":[71,94],"sufficiently":[72],"quickly?\u2019":[73],"Probabilistic":[74],"timed":[75],"automata":[76],"used":[78],"formally":[80],"verify":[83],"against":[86],"properties":[87],"which":[88],"require":[89],"before":[95],"deadline":[97],"with":[98],"probability.":[101],"use":[103],"techniques":[104,123],"abstraction,":[107],"reachability":[108],"analysis":[109],"integer-time":[111],"semantics":[112],"aid":[114],"model-checking":[116],"process,":[117],"efficacy":[120],"these":[122],"compared.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}
