{"id":"https://openalex.org/W4415400287","doi":"https://doi.org/10.1109/etfa65518.2025.11205668","title":"Decomposition of LTL specifications via formal concurrency relations in B\u00fcchi automata","display_name":"Decomposition of LTL specifications via formal concurrency relations in B\u00fcchi automata","publication_year":2025,"publication_date":"2025-09-09","ids":{"openalex":"https://openalex.org/W4415400287","doi":"https://doi.org/10.1109/etfa65518.2025.11205668"},"language":null,"primary_location":{"id":"doi:10.1109/etfa65518.2025.11205668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa65518.2025.11205668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 30th International Conference on Emerging Technologies 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/A5002142444","display_name":"Ioana Hustiu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ioana Hustiu","raw_affiliation_strings":["Technical University of Iasi,Faculty of Automatic Control and Control Engineering,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Iasi,Faculty of Automatic Control and Control Engineering,Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046534630","display_name":"Marius Kloetzer","orcid":"https://orcid.org/0000-0003-4338-0421"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Marius Kloetzer","raw_affiliation_strings":["Technical University of Iasi,Faculty of Automatic Control and Control Engineering,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Iasi,Faculty of Automatic Control and Control Engineering,Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085504277","display_name":"Cristian Mahulea","orcid":"https://orcid.org/0000-0003-0056-2225"},"institutions":[{"id":"https://openalex.org/I255234318","display_name":"Universidad de Zaragoza","ror":"https://ror.org/012a91z28","country_code":"ES","type":"education","lineage":["https://openalex.org/I255234318"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Cristian Mahulea","raw_affiliation_strings":["University of Zaragoza,Aragón Institute of Engineering Research (I3A),Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Zaragoza,Aragón Institute of Engineering Research (I3A),Spain","institution_ids":["https://openalex.org/I255234318"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9979000091552734,"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.9979000091552734,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9891999959945679,"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"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9821000099182129,"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/concurrency","display_name":"Concurrency","score":0.8312000036239624},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5552999973297119},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5328999757766724},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5098999738693237},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.44209998846054077},{"id":"https://openalex.org/keywords/isolation","display_name":"Isolation (microbiology)","score":0.4318000078201294},{"id":"https://openalex.org/keywords/concurrent-computing","display_name":"Concurrent computing","score":0.40450000762939453},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.40400001406669617},{"id":"https://openalex.org/keywords/concurrency-control","display_name":"Concurrency control","score":0.3977000117301941}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8312000036239624},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8079000115394592},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5552999973297119},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5504999756813049},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5328999757766724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5253999829292297},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5098999738693237},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C2775941552","wikidata":"https://www.wikidata.org/wiki/Q25212305","display_name":"Isolation (microbiology)","level":2,"score":0.4318000078201294},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.40400001406669617},{"id":"https://openalex.org/C84511453","wikidata":"https://www.wikidata.org/wiki/Q2914952","display_name":"Concurrency control","level":3,"score":0.3977000117301941},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C208087996","wikidata":"https://www.wikidata.org/wiki/Q5283142","display_name":"Distributed concurrency control","level":4,"score":0.365200012922287},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.3644999861717224},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36419999599456787},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C61912525","wikidata":"https://www.wikidata.org/wiki/Q7048952","display_name":"Non-lock concurrency control","level":5,"score":0.3617999851703644},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C3701939","wikidata":"https://www.wikidata.org/wiki/Q5159109","display_name":"Concurrent object-oriented programming","level":5,"score":0.3531999886035919},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.3402999937534332},{"id":"https://openalex.org/C116253237","wikidata":"https://www.wikidata.org/wiki/Q1437424","display_name":"Formal specification","level":2,"score":0.33719998598098755},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.30570000410079956},{"id":"https://openalex.org/C79240183","wikidata":"https://www.wikidata.org/wiki/Q1779327","display_name":"Optimistic concurrency control","level":5,"score":0.30160000920295715},{"id":"https://openalex.org/C2985583900","wikidata":"https://www.wikidata.org/wiki/Q722617","display_name":"Formal description","level":2,"score":0.30090001225471497},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.2948000133037567},{"id":"https://openalex.org/C35819235","wikidata":"https://www.wikidata.org/wiki/Q186868","display_name":"Timestamp-based concurrency control","level":5,"score":0.28139999508857727},{"id":"https://openalex.org/C108744092","wikidata":"https://www.wikidata.org/wiki/Q93695","display_name":"Multiversion concurrency control","level":5,"score":0.2721000015735626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26420000195503235},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2549000084400177},{"id":"https://openalex.org/C155214134","wikidata":"https://www.wikidata.org/wiki/Q1120460","display_name":"Communicating sequential processes","level":4,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/etfa65518.2025.11205668","is_oa":false,"landing_page_url":"https://doi.org/10.1109/etfa65518.2025.11205668","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 30th International Conference on Emerging Technologies and Factory Automation (ETFA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338298","display_name":"Office of Naval Research Global","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,30,51,68,125],"method":[4,79],"for":[5,61,71],"decomposing":[6],"Linear":[7],"Temporal":[8],"Logic":[9],"(LTL)":[10],"specifications":[11],"into":[12,92],"independent":[13],"parts":[14],"based":[15],"on":[16],"structures":[17],"recognized":[18],"in":[19],"their":[20],"corresponding":[21],"B\u00fcchi":[22,88],"automata":[23],"representations.":[24],"The":[25,78],"goal":[26],"is":[27],"to":[28,118],"obtain":[29],"decomposition":[31],"that":[32,45],"allows":[33],"the":[34,37,76,86,106,112],"execution":[35],"of":[36,53,85,94,108],"global":[38],"mission":[39],"by":[40,50],"identifying":[41],"and":[42,63,66,96,99],"formalizing":[43],"segments":[44],"can":[46],"be":[47],"executed":[48],"concurrently":[49],"team":[52],"mobile":[54],"robots.":[55],"We":[56],"introduce":[57],"formal":[58,114],"concurrency":[59,103],"characterization":[60],"two":[62],"three":[64,119],"tasks,":[65,98,121],"provide":[67],"structured":[69],"framework":[70,115],"recognizing":[72],"these":[73],"patterns":[74],"within":[75],"automaton.":[77],"algorithmically":[80],"analyses":[81],"an":[82],"accepted":[83],"run":[84],"trimmed":[87],"automaton,":[89],"partitions":[90],"it":[91,122],"containers":[93],"sequential":[95],"concurrent":[97,120],"incrementally":[100],"extends":[101],"this":[102],"while":[104],"reducing":[105],"number":[107],"synchronization":[109],"points.":[110],"Although":[111],"current":[113],"supports":[116],"up":[117],"may":[123],"represent":[124],"step":[126],"towards":[127],"generalization.":[128]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-22T00:00:00"}