{"id":"https://openalex.org/W1489482702","doi":"https://doi.org/10.1007/1-4020-8141-3_30","title":"On Complexity of Model-Checking for the TQL Logic","display_name":"On Complexity of Model-Checking for the TQL Logic","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W1489482702","doi":"https://doi.org/10.1007/1-4020-8141-3_30","mag":"1489482702"},"language":"en","primary_location":{"id":"doi:10.1007/1-4020-8141-3_30","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_30","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_30.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_30.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057438862","display_name":"Iovka Boneva","orcid":"https://orcid.org/0000-0002-2696-7303"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Iovka Boneva","raw_affiliation_strings":["Laboratoire d\u2019Informatique Foundamentale de Lille, France INRIA team Mostrare, France","France INRIA team Mostrare"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Foundamentale de Lille, France INRIA team Mostrare, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"France INRIA team Mostrare","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113484548","display_name":"Jean-Marc Talbot","orcid":null},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jean-Marc Talbot","raw_affiliation_strings":["Laboratoire d\u2019Informatique Foundamentale de Lille, France INRIA team Mostrare, France","France INRIA team Mostrare"],"affiliations":[{"raw_affiliation_string":"Laboratoire d\u2019Informatique Foundamentale de Lille, France INRIA team Mostrare, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"France INRIA team Mostrare","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057438862"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":1.2496,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76898288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"381","last_page":"394"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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.9984999895095825,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9983999729156494,"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/pspace","display_name":"PSPACE","score":0.8617828488349915},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7620128393173218},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5834391117095947},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5495535135269165},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5437610745429993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5035244822502136},{"id":"https://openalex.org/keywords/computation-tree-logic","display_name":"Computation tree logic","score":0.49772003293037415},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.49084192514419556},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.46381160616874695},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.45276394486427307},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.45208752155303955},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.42146578431129456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4188109040260315},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.4185945689678192},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3845328986644745}],"concepts":[{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.8617828488349915},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7620128393173218},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5834391117095947},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5495535135269165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5437610745429993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5035244822502136},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.49772003293037415},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.49084192514419556},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.46381160616874695},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.45276394486427307},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.45208752155303955},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.42146578431129456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4188109040260315},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.4185945689678192},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3845328986644745},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/1-4020-8141-3_30","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_30","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_30.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.6506","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6506","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.grappa.univ-lille3.fr/twiki/pub/Private/IovkaBoneva/BonevaTalbot-ModelChecking.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1007/1-4020-8141-3_30","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_30","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F1-4020-8141-3_30.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1489482702.pdf","grobid_xml":"https://content.openalex.org/works/W1489482702.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1501264070","https://openalex.org/W1502591061","https://openalex.org/W1518388247","https://openalex.org/W1527664624","https://openalex.org/W1558791089","https://openalex.org/W1579407214","https://openalex.org/W1992582873","https://openalex.org/W2012841134","https://openalex.org/W2028357390","https://openalex.org/W2029632316","https://openalex.org/W2052432706","https://openalex.org/W2065251436","https://openalex.org/W2136451095","https://openalex.org/W2167998587","https://openalex.org/W2912003593","https://openalex.org/W2912478644","https://openalex.org/W6630150388","https://openalex.org/W6633627894","https://openalex.org/W6634622667"],"related_works":["https://openalex.org/W1504200807","https://openalex.org/W4236887310","https://openalex.org/W278676640","https://openalex.org/W1520700928","https://openalex.org/W103968499","https://openalex.org/W1583470866","https://openalex.org/W1984423678","https://openalex.org/W2026191634","https://openalex.org/W1717627737","https://openalex.org/W2007014039"],"abstract_inverted_index":{"In":[0],"this":[1,34,100],"paper":[2],"we":[3,92],"study":[4,61],"the":[5,8,12,17,20,52,79,88,103,107],"complexity":[6,54,63],"of":[7,33,55,64,78],"model-checking":[9,65,97,104],"problem":[10,105],"for":[11,19,72,75,82,87,106],"tree":[13],"logic":[14,109],"introduced":[15],"as":[16],"basis":[18],"query":[21],"language":[22],"TQL":[23,108],"[Cardelli":[24],"and":[25,41,47,66,85],"Ghelli,":[26],"2001].":[27],"We":[28,49,59],"define":[29],"two":[30],"distinct":[31],"fragments":[32],"logic:":[35],"TL":[36,42,56,83],"containing":[37,44],"only":[38],"spatial":[39,45],"connectives":[40,46],"\u0437":[43,84],"quantification.":[48],"show":[50,67],"that":[51,68,102],"combined":[53],"is":[57,70,110],"PSPACE-hard.":[58],"also":[60],"data":[62],"it":[69],"linear":[71],"TL,":[73],"hard":[74],"all":[76],"levels":[77],"polynomial":[80,95],"hierarchy":[81],"PSPACE-hard":[86],"full":[89],"logic.":[90],"Finally":[91],"devise":[93],"a":[94],"space":[96],"algorithm":[98],"showing":[99],"way":[101],"PSPACE-complete.":[111]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}