{"id":"https://openalex.org/W4413131612","doi":"https://doi.org/10.1145/3759917","title":"A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators","display_name":"A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators","publication_year":2025,"publication_date":"2025-08-08","ids":{"openalex":"https://openalex.org/W4413131612","doi":"https://doi.org/10.1145/3759917"},"language":"en","primary_location":{"id":"doi:10.1145/3759917","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3759917","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3759917","source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3759917","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048003088","display_name":"Beatrice Melani","orcid":"https://orcid.org/0000-0002-9051-1597"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Beatrice Melani","raw_affiliation_strings":["Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano","Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano","institution_ids":["https://openalex.org/I93860229"]},{"raw_affiliation_string":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milan, Italy","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050836932","display_name":"Ezio Bartocci","orcid":"https://orcid.org/0000-0002-8004-6601"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ezio Bartocci","raw_affiliation_strings":["Institute of Computer Engineering (E191-01), TU Wien","Institute of Computer Engineering (E191-01), TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Engineering (E191-01), TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Institute of Computer Engineering (E191-01), TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090191859","display_name":"Michele Chiari","orcid":"https://orcid.org/0000-0001-7742-9233"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Michele Chiari","raw_affiliation_strings":["Institute of Computer Engineering (E191-01), TU Wien","Institute of Computer Engineering (E191-01), TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Computer Engineering (E191-01), TU Wien","institution_ids":["https://openalex.org/I145847075"]},{"raw_affiliation_string":"Institute of Computer Engineering (E191-01), TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048003088"],"corresponding_institution_ids":["https://openalex.org/I93860229"],"apc_list":null,"apc_paid":null,"fwci":1.385,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.85036096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"24","issue":"5s","first_page":"1","last_page":"26"},"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9944999814033508,"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/T13295","display_name":"Safety Systems Engineering in Autonomy","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.699376106262207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6575298309326172},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.6308326125144958},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6168080568313599},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6089336276054382},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6058548092842102},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5607091188430786},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5539019107818604},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5450161099433899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.530799925327301},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48468759655952454},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4261242747306824},{"id":"https://openalex.org/keywords/interval-temporal-logic","display_name":"Interval temporal logic","score":0.4102446436882019},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3517317473888397},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2707015872001648},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26914098858833313}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.699376106262207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6575298309326172},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.6308326125144958},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6168080568313599},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6089336276054382},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6058548092842102},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5607091188430786},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5539019107818604},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5450161099433899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.530799925327301},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48468759655952454},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4261242747306824},{"id":"https://openalex.org/C162670838","wikidata":"https://www.wikidata.org/wiki/Q6057295","display_name":"Interval temporal logic","level":3,"score":0.4102446436882019},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3517317473888397},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2707015872001648},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26914098858833313},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3759917","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3759917","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3759917","source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-article"},{"id":"pmh:oai:re.public.polimi.it:11311/1297698","is_oa":true,"landing_page_url":"https://hdl.handle.net/11311/1297698","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"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":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3759917","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3759917","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3759917","source":{"id":"https://openalex.org/S136160450","display_name":"ACM Transactions on Embedded Computing Systems","issn_l":"1539-9087","issn":["1539-9087","1558-3465"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Embedded Computing Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1121060683","display_name":"ROBUSTIFYING GENERATIVE AI THROUGH HUMAN-CENTRIC INTEGRATION OF NEURAL AND SYMBOLIC METHODS","funder_award_id":"101212818","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3650733657","display_name":null,"funder_award_id":"NextGenerationEU","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G4875562163","display_name":"Verification and Analysis for Safety and Security of Applications in Life","funder_award_id":"101160022","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5431178829","display_name":null,"funder_award_id":"ICT22-023 (TAIGER)","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"},{"id":"https://openalex.org/G5538284277","display_name":null,"funder_award_id":"National Recovery","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G7857191327","display_name":"COntext-free model checking for Recursive PrObabilistic pRogrAms","funder_award_id":"101107303","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8318064016","display_name":null,"funder_award_id":"Horizon","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8386731437","display_name":null,"funder_award_id":"Resilience Plan (NRRP)","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G9545554","display_name":null,"funder_award_id":"101107303","funder_id":"https://openalex.org/F4320334322","funder_display_name":"HORIZON EUROPE Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413131612.pdf","grobid_xml":"https://content.openalex.org/works/W4413131612.grobid-xml"},"referenced_works_count":54,"referenced_works":["https://openalex.org/W209085883","https://openalex.org/W233122475","https://openalex.org/W805171677","https://openalex.org/W1480909796","https://openalex.org/W1489391022","https://openalex.org/W1498432697","https://openalex.org/W1539868891","https://openalex.org/W1547304883","https://openalex.org/W1982302236","https://openalex.org/W2018152575","https://openalex.org/W2023808162","https://openalex.org/W2026629052","https://openalex.org/W2030263557","https://openalex.org/W2033040247","https://openalex.org/W2049696538","https://openalex.org/W2068619069","https://openalex.org/W2079880156","https://openalex.org/W2086023301","https://openalex.org/W2092884371","https://openalex.org/W2125708466","https://openalex.org/W2139891885","https://openalex.org/W2182828685","https://openalex.org/W2293761843","https://openalex.org/W2520933253","https://openalex.org/W2522513585","https://openalex.org/W2549790574","https://openalex.org/W2568050379","https://openalex.org/W2571592482","https://openalex.org/W2735404318","https://openalex.org/W2740520395","https://openalex.org/W2752069948","https://openalex.org/W2785700716","https://openalex.org/W2798155353","https://openalex.org/W2900411537","https://openalex.org/W2909776947","https://openalex.org/W3034562037","https://openalex.org/W3113301275","https://openalex.org/W3115878638","https://openalex.org/W3119924191","https://openalex.org/W3142060193","https://openalex.org/W3149985185","https://openalex.org/W4210458612","https://openalex.org/W4231001973","https://openalex.org/W4248924411","https://openalex.org/W4281812495","https://openalex.org/W4284699363","https://openalex.org/W4295850088","https://openalex.org/W4300021588","https://openalex.org/W4320005455","https://openalex.org/W4323026588","https://openalex.org/W4392865228","https://openalex.org/W4405871132","https://openalex.org/W4406698759","https://openalex.org/W6632308403"],"related_works":["https://openalex.org/W1532447905","https://openalex.org/W858755136","https://openalex.org/W31328628","https://openalex.org/W1981889059","https://openalex.org/W2352091395","https://openalex.org/W3005864166","https://openalex.org/W946220898","https://openalex.org/W2996932295","https://openalex.org/W2759584604","https://openalex.org/W1526924704"],"abstract_inverted_index":{"Signal":[0],"Temporal":[1,168],"Logic":[2,169,183],"(STL)":[3],"is":[4,31,44,57],"a":[5,39,79,102,111,189],"widely":[6],"recognized":[7],"formal":[8],"specification":[9],"language":[10],"to":[11,33,50,97,154,164],"express":[12],"rigorous":[13],"temporal":[14,93],"requirements":[15,43],"on":[16,188],"mixed":[17],"analog":[18],"signals":[19,123],"produced":[20],"by":[21,71,200],"cyber-physical":[22],"systems":[23],"(CPS).":[24],"A":[25],"relevant":[26],"problem":[27,48],"in":[28,66,151,208],"CPS":[29],"design":[30],"how":[32],"efficiently":[34],"and":[35,137,159,181,197],"automatically":[36],"check":[37,165],"whether":[38],"set":[40,104],"of":[41,88,101,105,114,139],"STL":[42,53,90,106,140,152],"logically":[45],"consistent.":[46],"This":[47,76],"reduces":[49],"solving":[51],"the":[52,99,126,135,186,195],"satisfiability":[54,86,157],"problem,":[55],"which":[56],"decidable":[58],"when":[59],"we":[60],"assume":[61],"that":[62,124],"our":[63,174,211],"system":[64],"operates":[65],"discrete":[67],"time":[68,149],"steps":[69],"dictated":[70],"an":[72,201],"embedded":[73],"system\u2019s":[74],"clock.":[75],"article":[77],"introduces":[78],"novel":[80],"tree-shaped,":[81],"one-pass":[82],"tableau":[83,143,175,212],"method":[84,109],"for":[85],"checking":[87],"discrete-time":[89],"with":[91,176],"bounded":[92],"operators.":[94],"Originally":[95],"designed":[96],"prove":[98],"consistency":[100,117],"given":[103,127],"requirements,":[107,128],"this":[108],"has":[110],"wide":[112],"range":[113],"applications":[115],"beyond":[116],"checking.":[118],"These":[119],"include":[120],"synthesizing":[121],"example":[122],"satisfy":[125],"as":[129,131],"well":[130],"verifying":[132],"or":[133],"refuting":[134],"equivalence":[136],"implications":[138],"formulas.":[141],"Our":[142,204],"exploits":[144],"redundancy":[145],"arising":[146],"from":[147,185,194],"large":[148],"intervals":[150],"formulas":[153],"speed":[155],"up":[156],"checking,":[158],"can":[160],"also":[161],"be":[162],"employed":[163],"Mission-Time":[166],"Linear":[167],"(MLTL)":[170],"satisfiability.":[171],"We":[172],"compare":[173],"Satisfiability":[177],"Modulo":[178],"Theories":[179],"(SMT)":[180],"First-Order":[182],"encodings":[184],"literature":[187],"benchmark":[190],"suite,":[191],"partly":[192,198],"collected":[193],"literature,":[196],"provided":[199],"industrial":[202],"partner.":[203],"experiments":[205],"show":[206],"that,":[207],"many":[209],"cases,":[210],"outperforms":[213],"state-of-the-art":[214],"encodings.":[215]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}