{"id":"https://openalex.org/W1976412619","doi":"https://doi.org/10.1016/s1571-0661(05)80445-1","title":"The Saga of Synchronous Bus Arbiter: On Model Checking Quantitative Timing Properties of Synchronous Programs","display_name":"The Saga of Synchronous Bus Arbiter: On Model Checking Quantitative Timing Properties of Synchronous Programs","publication_year":2002,"publication_date":"2002-07-01","ids":{"openalex":"https://openalex.org/W1976412619","doi":"https://doi.org/10.1016/s1571-0661(05)80445-1","mag":"1976412619"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80445-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80445-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(05)80445-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5027806769","display_name":"Paritosh K. Pandya","orcid":"https://orcid.org/0000-0001-7085-0148"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Paritosh K. Pandya","raw_affiliation_strings":["School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road, Colaba, Mumbai 400005, India"],"affiliations":[{"raw_affiliation_string":"School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road, Colaba, Mumbai 400005, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5027806769"],"corresponding_institution_ids":["https://openalex.org/I11947397"],"apc_list":null,"apc_paid":null,"fwci":0.6999,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.67354243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"65","issue":"5","first_page":"110","last_page":"124"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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.9891999959945679,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9884999990463257,"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/arbiter","display_name":"Arbiter","score":0.954651951789856},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7380011677742004},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6018369793891907},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5837165117263794},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.48837417364120483},{"id":"https://openalex.org/keywords/observer","display_name":"Observer (physics)","score":0.4535544514656067},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42856454849243164},{"id":"https://openalex.org/keywords/static-timing-analysis","display_name":"Static timing analysis","score":0.42416203022003174},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42188045382499695},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.4189896285533905},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.4188348054885864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3725596070289612},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3578254282474518},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2441222369670868},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.16896215081214905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16359543800354004},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14640659093856812}],"concepts":[{"id":"https://openalex.org/C2779971761","wikidata":"https://www.wikidata.org/wiki/Q629872","display_name":"Arbiter","level":2,"score":0.954651951789856},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7380011677742004},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6018369793891907},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5837165117263794},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.48837417364120483},{"id":"https://openalex.org/C2780704645","wikidata":"https://www.wikidata.org/wiki/Q9251458","display_name":"Observer (physics)","level":2,"score":0.4535544514656067},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42856454849243164},{"id":"https://openalex.org/C93682380","wikidata":"https://www.wikidata.org/wiki/Q2025226","display_name":"Static timing analysis","level":2,"score":0.42416203022003174},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42188045382499695},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.4189896285533905},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.4188348054885864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3725596070289612},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3578254282474518},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2441222369670868},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.16896215081214905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16359543800354004},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14640659093856812},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(05)80445-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80445-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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.24.9058","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.9058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.tcs.tifr.res.in/~pandya/dccheck/arbsaga.ps","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80445-1","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80445-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":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1497282068","https://openalex.org/W1503170978","https://openalex.org/W1505562022","https://openalex.org/W1511336169","https://openalex.org/W1553233117","https://openalex.org/W1578881602","https://openalex.org/W1591643794","https://openalex.org/W1822320350","https://openalex.org/W1992552504","https://openalex.org/W2000916035","https://openalex.org/W2038569232","https://openalex.org/W2139473437","https://openalex.org/W2144026067","https://openalex.org/W2144039444","https://openalex.org/W2167467151","https://openalex.org/W4285719527","https://openalex.org/W6603976097","https://openalex.org/W6650501873","https://openalex.org/W6704706996"],"related_works":["https://openalex.org/W4317533142","https://openalex.org/W4297758500","https://openalex.org/W2933542995","https://openalex.org/W2884238308","https://openalex.org/W4313193894","https://openalex.org/W1967754004","https://openalex.org/W2724597727","https://openalex.org/W2746280673","https://openalex.org/W2369041327","https://openalex.org/W2080028974"],"abstract_inverted_index":{"Quantified":[0],"Discrete-time":[1],"Duration":[2],"Calculus,":[3],"(QDDC),":[4],"is":[5,14],"a":[6,34,38,55,64,73],"form":[7],"of":[8,22,46,63,83,114],"interval":[9],"temporal":[10],"logic":[11],"[14].":[12],"It":[13],"well":[15],"suited":[16],"to":[17,135],"specify":[18,109],"quantitative":[19,112],"timing":[20],"properties":[21,82,113,140],"synchronous":[23,56,65,84,100],"systems.":[24],"An":[25],"automata":[26],"theoretic":[27],"decision":[28],"procedure":[29],"for":[30,58],"QDDC":[31,35,81],"allows":[32],"converting":[33],"formula":[36],"into":[37,72],"finite":[39],"state":[40],"automaton":[41,50],"recognising":[42],"precisely":[43],"the":[44,47,61,106,129],"models":[45],"formula.":[48],"The":[49],"can":[51,132],"be":[52,133],"used":[53,134],"as":[54],"observer":[57],"model":[59,79,137],"checking":[60,80],"property":[62],"program.":[66],"This":[67],"theory":[68],"has":[69],"been":[70],"implemented":[71],"tool":[74,130],"called":[75],"DCVALID":[76,131],"which":[77],"permits":[78],"programs":[85],"written":[86],"in":[87],"Esterel,":[88],"Verilog":[89],"and":[90,121],"SMV":[91],"notations.":[92],"In":[93],"this":[94],"paper,":[95],"we":[96],"consider":[97],"two":[98],"well-known":[99],"bus":[101],"arbiter":[102],"circuits":[103],"(programs)":[104],"from":[105],"literature.":[107],"We":[108,126],"some":[110,142],"complex":[111],"these":[115,139],"arbiters,":[116],"including":[117],"their":[118],"response":[119],"time":[120],"loss":[122],"time,":[123],"using":[124],"QDDC.":[125],"show":[127],"how":[128],"effectively":[136],"check":[138],"(with":[141],"surprising":[143],"results).":[144]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}