{"id":"https://openalex.org/W4321360133","doi":"https://doi.org/10.3103/s0146411622070057","title":"Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic","display_name":"Satisfiability and Model Checking for One Parameterized Extension of Linear Temporal Logic","publication_year":2022,"publication_date":"2022-12-01","ids":{"openalex":"https://openalex.org/W4321360133","doi":"https://doi.org/10.3103/s0146411622070057"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411622070057","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411622070057","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","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/A5082436525","display_name":"Anton Gnatenko","orcid":"https://orcid.org/0000-0003-1499-2090"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"A. R. Gnatenko","raw_affiliation_strings":["National Research University Higher School of Economics (HSE), 101000, Moscow, Russia"],"raw_orcid":"https://orcid.org/0000-0003-1499-2090","affiliations":[{"raw_affiliation_string":"National Research University Higher School of Economics (HSE), 101000, Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062447638","display_name":"\u0412. \u0410. \u0417\u0430\u0445\u0430\u0440\u043e\u0432","orcid":"https://orcid.org/0000-0002-3794-9565"},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I4210101868","display_name":"Institute for System Programming","ror":"https://ror.org/017ef8252","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210101868","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"V. A. Zakharov","raw_affiliation_strings":["Ivannikov Institute for System Programming, Russian Academy of Sciences, 109004, Moscow, Russia","National Research University Higher School of Economics (HSE), 101000, Moscow, Russia"],"raw_orcid":"https://orcid.org/0000-0002-3794-9565","affiliations":[{"raw_affiliation_string":"Ivannikov Institute for System Programming, Russian Academy of Sciences, 109004, Moscow, Russia","institution_ids":["https://openalex.org/I4210101868"]},{"raw_affiliation_string":"National Research University Higher School of Economics (HSE), 101000, Moscow, Russia","institution_ids":["https://openalex.org/I118501908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062447638","https://openalex.org/A5082436525"],"corresponding_institution_ids":["https://openalex.org/I118501908","https://openalex.org/I4210101868"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22045003,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":"7","first_page":"649","last_page":"660"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9991999864578247,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8884247541427612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8675611019134521},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.8312511444091797},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.7788137793540955},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6263458132743835},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.5773364305496216},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.5222412347793579},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5143684148788452},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.4220314025878906},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41253456473350525},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.39008256793022156}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8884247541427612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8675611019134521},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.8312511444091797},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7788137793540955},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6263458132743835},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.5773364305496216},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.5222412347793579},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5143684148788452},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.4220314025878906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41253456473350525},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39008256793022156}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411622070057","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411622070057","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1498203978","https://openalex.org/W1498432697","https://openalex.org/W1498781683","https://openalex.org/W1506588809","https://openalex.org/W1513400763","https://openalex.org/W1547589162","https://openalex.org/W1982129592","https://openalex.org/W2023808162","https://openalex.org/W2039529128","https://openalex.org/W2050398281","https://openalex.org/W2069709605","https://openalex.org/W2084910510","https://openalex.org/W2145394419","https://openalex.org/W2157319504","https://openalex.org/W2167907675","https://openalex.org/W2206596198","https://openalex.org/W2261362537","https://openalex.org/W2796510948","https://openalex.org/W2806619258","https://openalex.org/W2869244158","https://openalex.org/W2898369211","https://openalex.org/W4210386754"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W1551070491","https://openalex.org/W2034301573","https://openalex.org/W2350953867","https://openalex.org/W1592102986","https://openalex.org/W4312622265","https://openalex.org/W4281812495","https://openalex.org/W2477338659","https://openalex.org/W1967076997","https://openalex.org/W1507805823"],"abstract_inverted_index":{"Sequential":[0],"reactive":[1],"systems":[2,30],"are":[3,89,172],"computer":[4],"programs":[5],"or":[6,16,25],"hardware":[7],"devices":[8],"which":[9,135],"process":[10],"the":[11,21,39,42,100,104,140,178,189,194,204,211,219,240,243,250],"flows":[12],"of":[13,23,37,52,74,78,103,142,177,196,203,225,232,242,249,252],"input":[14,43,253],"data":[15],"control":[17],"signals":[18],"and":[19,44,63,86,111,125,159,167,229],"output":[20,45],"streams":[22],"instructions":[24],"responses.":[26],"When":[27],"designing":[28],"such":[29,53],"one":[31,237],"needs":[32],"formal":[33],"specification":[34,54],"languages":[35,55,198],"capable":[36],"expressing":[38],"relationships":[40],"between":[41],"flows.":[46],"Previously":[47],"we":[48,98,151],"introduced":[49,112],"a":[50,153,230,233],"family":[51],"based":[56],"on":[57],"temporal":[58,80,84,106],"logics":[59,81],"$$LTL$$":[60,110,119,166,216],",":[61,120,124],"$$CTL$$":[62,123],"$$CTL{\\kern":[64,128],"1pt}":[65],"*$$":[66],"combined":[67],"with":[68],"regular":[69,92,197],"languages.":[70,93],"A":[71],"characteristic":[72],"feature":[73],"these":[75,146],"new":[76,105],"extensions":[77],"conventional":[79],"is":[82,139,182,206],"that":[83,169,235],"operators":[85],"basic":[87],"predicates":[88],"parameterized":[90],"by":[91,185],"In":[94,148],"our":[95],"early":[96],"papers":[97],"estimated":[99],"expressive":[101],"power":[102],"logic":[107],"$$Reg$$":[108,117,121,126,164,214],"-":[109,118,122,127,165,215],"model":[113,160],"checking":[114,158,161,213],"algorithm":[115,208],"for":[116,145,163,193,209,222],"1pt}^{":[129],"*}$$":[130],".":[131],"The":[132,174,200],"main":[133,201],"issue":[134],"still":[136],"remains":[137],"unclear":[138],"complexity":[141],"decision":[143],"problems":[144,162,171,179],"logics.":[147],"this":[149],"paper":[150,205],"give":[152],"complete":[154],"solution":[155],"to":[156,187,218,238],"satisfiability":[157,212],"prove":[168],"both":[170],"Pspace-complete.":[173],"computational":[175],"hardness":[176],"under":[180],"consideration":[181],"easily":[183],"proved":[184],"reducing":[186,210],"them":[188],"intersection":[190],"emptyness":[191],"problem":[192,221],"families":[195],"[16].":[199],"result":[202],"an":[207],"formulas":[217],"emptiness":[220,241],"Buchi":[223],"automata":[224,245],"relatively":[226],"small":[227],"size":[228,251],"description":[231],"technique":[234],"allows":[236],"check":[239],"obtained":[244],"within":[246],"space":[247],"polynomial":[248],"formulas.":[254]},"counts_by_year":[],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}