{"id":"https://openalex.org/W2162181585","doi":"https://doi.org/10.1145/1507244.1507245","title":"Checking timed B\u00fcchi automata emptiness on simulation graphs","display_name":"Checking timed B\u00fcchi automata emptiness on simulation graphs","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2162181585","doi":"https://doi.org/10.1145/1507244.1507245","mag":"2162181585"},"language":"en","primary_location":{"id":"doi:10.1145/1507244.1507245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1507244.1507245","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},"type":"article","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/A5080042319","display_name":"Stavros Tripakis","orcid":"https://orcid.org/0000-0002-1777-493X"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stavros Tripakis","raw_affiliation_strings":["University of California, Berkeley, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, CA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5080042319"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":3.4718,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.92825502,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"10","issue":"3","first_page":"1","last_page":"19"},"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/liveness","display_name":"Liveness","score":0.9238945841789246},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8989664316177368},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7007302045822144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6852930784225464},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6737614870071411},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.561061441898346},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5385412573814392},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5248213410377502},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.49156031012535095},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.4318602681159973},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3664936423301697},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3620951175689697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27389252185821533}],"concepts":[{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.9238945841789246},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8989664316177368},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7007302045822144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6852930784225464},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6737614870071411},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.561061441898346},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5385412573814392},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5248213410377502},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.49156031012535095},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.4318602681159973},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3664936423301697},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3620951175689697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27389252185821533}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1507244.1507245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1507244.1507245","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.105.5074","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.105.5074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-verimag.imag.fr/TR/TR-2006-1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.122.4170","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.4170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tocl.acm.org/accepted/307tripakis.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1482233117","https://openalex.org/W1505030820","https://openalex.org/W1529059198","https://openalex.org/W1569203277","https://openalex.org/W1593428110","https://openalex.org/W1601693417","https://openalex.org/W1874725288","https://openalex.org/W1977308797","https://openalex.org/W1981808971","https://openalex.org/W2000947342","https://openalex.org/W2007490191","https://openalex.org/W2012935476","https://openalex.org/W2100271265","https://openalex.org/W2101508170","https://openalex.org/W2117189826","https://openalex.org/W2118382442","https://openalex.org/W2130773092","https://openalex.org/W2132334337","https://openalex.org/W2133057837","https://openalex.org/W2139796094","https://openalex.org/W2153669449","https://openalex.org/W2340735175","https://openalex.org/W2913459036"],"related_works":["https://openalex.org/W2961758588","https://openalex.org/W2099490078","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2103504376","https://openalex.org/W2153337086","https://openalex.org/W2135051863","https://openalex.org/W2150468037","https://openalex.org/W1651168384"],"abstract_inverted_index":{"Timed":[0],"automata":[1],"[Alur":[2],"and":[3,13,16,27,70,84],"Dill":[4],"1994]":[5],"comprise":[6],"a":[7,63],"popular":[8],"model":[9],"for":[10,44,105],"describing":[11],"real-time":[12],"embedded":[14],"systems":[15],"reasoning":[17],"formally":[18],"about":[19],"them.":[20],"Efficient":[21],"model-checking":[22],"algorithms":[23,56],"have":[24],"been":[25,72],"developed":[26],"implemented":[28],"in":[29,109],"tools":[30],"such":[31],"as":[32],"Kronos":[33],"[Daws":[34],"et":[35,41,89,93],"al.":[36,42,90,94],"1996]":[37],"or":[38],"Uppaal":[39],"[Larsen":[40],"1997]":[43],"checking":[45,106],"safety":[46],"properties":[47],"on":[48],"this":[49,99],"model,":[50],"which":[51],"amounts":[52],"to":[53,75],"reachability.":[54],"These":[55],"use":[57],"the":[58],"so-called":[59],"zone-closed":[60],"simulation":[61],"graph,":[62],"finite":[64],"graph":[65,100],"that":[66,98],"admits":[67],"efficient":[68],"representation":[69],"has":[71],"recently":[73],"shown":[74],"preserve":[76],"reachability":[77],"[Bouyer":[78],"2004].":[79],"Building":[80],"upon":[81],"Bouyer":[82],"[2004]":[83],"our":[85],"previous":[86],"work":[87],"[Bouajjani":[88],"1997;":[91],"Tripakis":[92],"2005],":[95],"we":[96],"show":[97],"can":[101],"also":[102],"be":[103],"used":[104],"liveness":[107],"properties,":[108],"particular,":[110],"emptiness":[111],"of":[112],"timed":[113],"B\u00fcchi":[114],"automata.":[115]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}