{"id":"https://openalex.org/W2040273842","doi":"https://doi.org/10.4304/jsw.9.4.970-976","title":"Conversion Algorithm of Linear-Time Temporal Logic to Buchi Automata","display_name":"Conversion Algorithm of Linear-Time Temporal Logic to Buchi Automata","publication_year":2014,"publication_date":"2014-04-01","ids":{"openalex":"https://openalex.org/W2040273842","doi":"https://doi.org/10.4304/jsw.9.4.970-976","mag":"2040273842"},"language":"en","primary_location":{"id":"doi:10.4304/jsw.9.4.970-976","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.9.4.970-976","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","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/A5039732696","display_name":"Laixiang Shan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laixiang Shan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100695329","display_name":"Zheng Qin","orcid":"https://orcid.org/0000-0003-4373-4111"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zheng Qin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100359468","display_name":"Shengnan Li","orcid":"https://orcid.org/0000-0002-2305-3186"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shengnan Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101772672","display_name":"Renwei Zhang","orcid":"https://orcid.org/0000-0002-9744-5676"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Renwei Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031297322","display_name":"Xiao Yang","orcid":"https://orcid.org/0000-0002-5834-5197"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7147,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.71925427,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"9","issue":"4","first_page":null,"last_page":null},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9983000159263611,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9955000281333923,"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/computer-science","display_name":"Computer science","score":0.8721855878829956},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.7326329350471497},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6224003434181213},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5695272088050842},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5562528967857361},{"id":"https://openalex.org/keywords/b\u00fcchi-automaton","display_name":"B\u00fcchi automaton","score":0.5244279503822327},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33551496267318726},{"id":"https://openalex.org/keywords/deterministic-automaton","display_name":"Deterministic automaton","score":0.20994862914085388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8721855878829956},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.7326329350471497},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6224003434181213},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5695272088050842},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5562528967857361},{"id":"https://openalex.org/C165753454","wikidata":"https://www.wikidata.org/wiki/Q1020380","display_name":"B\u00fcchi automaton","level":4,"score":0.5244279503822327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33551496267318726},{"id":"https://openalex.org/C194525867","wikidata":"https://www.wikidata.org/wiki/Q5265707","display_name":"Deterministic automaton","level":3,"score":0.20994862914085388}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jsw.9.4.970-976","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jsw.9.4.970-976","pdf_url":null,"source":{"id":"https://openalex.org/S114141714","display_name":"Journal of Software","issn_l":"1796-217X","issn":["1796-217X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W79986586","https://openalex.org/W1492929237","https://openalex.org/W1507105430","https://openalex.org/W1507116188","https://openalex.org/W1516806823","https://openalex.org/W2013635074","https://openalex.org/W2034718467","https://openalex.org/W2045235791","https://openalex.org/W2089003125","https://openalex.org/W2095323179","https://openalex.org/W2107182799","https://openalex.org/W2112885720","https://openalex.org/W2115309705","https://openalex.org/W2913459036","https://openalex.org/W6603387552","https://openalex.org/W6629520775","https://openalex.org/W6630996812","https://openalex.org/W6676308876"],"related_works":["https://openalex.org/W2153551293","https://openalex.org/W2108751562","https://openalex.org/W2110468917","https://openalex.org/W1513159096","https://openalex.org/W2338673411","https://openalex.org/W1604890813","https://openalex.org/W2359102888","https://openalex.org/W1967076997","https://openalex.org/W2283260145","https://openalex.org/W2362494442"],"abstract_inverted_index":{"The":[0,68,134,150],"size":[1,38,135,190],"of":[2,34,39,43,85,97,136,161,191],"Buchi":[3,64],"Automata(BA)":[4],"is":[5,70,114,129],"a":[6],"key":[7],"factor":[8],"during":[9],"converting":[10,44],"Linear-Time":[11],"Temporal":[12],"Logic(LTL)":[13],"formulae":[14,61],"to":[15,62,116],"BA":[16,23,40,99,138],"in":[17,75,78,131,182],"model":[18,76],"checking.":[19],"Most":[20],"algorithms":[21],"forgenerating":[22],"from":[24],"LTL":[25,60],"formulas":[26],"involved":[27],"intermediate":[28],"automata,":[29],"degeneralization":[30],"algorithm":[31,69,151,180],"and":[32,41,89,118,139,167,171],"simplification":[33],"the":[35,83,95,98,132,154,159,164,179,188],"formulas,":[36],"but":[37],"time":[42],"can":[45,92,142,152],"be":[46,143],"reduced":[47,144],"further.":[48],"In":[49],"this":[50,183],"paper,":[51],"we":[52,91],"present":[53],"an":[54],"improved":[55],"Tableau-based":[56],"algorithm,":[57],"which":[58],"converts":[59],"Transition-based":[63],"Automata(TBA)":[65],"more":[66],"efficiently.":[67],"geared":[71],"towards":[72],"being":[73],"used":[74,115],"checking":[77],"on-the-fly":[79,148],"fashion.":[80],"By":[81],"attaching":[82],"satisfyinformation":[84],"U-formula":[86],"on":[87],"states":[88,170],"transitions,":[90],"decide":[93],"whether":[94],"sequences":[96],"are":[100],"acceptableby":[101],"using":[102,147],"only":[103],"one":[104],"acceptance":[105],"condition":[106],"set,":[107],"not":[108],"multiple":[109],"ones.":[110],"Binary":[111],"Decision":[112],"Diagrams(BDD)":[113],"describeBA":[117],"simplify":[119],"formulae.":[120],"A":[121],"better":[122],"data":[123],"structure,":[124],"syntax":[125],"Directed":[126],"Acyclic":[127],"Graph(DAG),\u00a0":[128],"adopted":[130],"algorithm.":[133],"product":[137],"computational":[140],"complexity":[141],"significantly":[145],"by":[146],"degeneralization.":[149],"expand":[153],"state":[155],"nodes":[156,166],"while":[157],"detecting":[158],"validity":[160],"nodes,":[162],"removing":[163],"invalid":[165],"combining":[168],"equivalent":[169],"transitions.":[172],"Compared":[173],"with":[174,187],"other":[175],"recent":[176],"conversion":[177],"tools,\u00a0":[178],"proposed":[181],"paper":[184],"runs":[185],"faster,":[186],"smaller":[189],"BA.":[192]},"counts_by_year":[{"year":2019,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}