{"id":"https://openalex.org/W2019785612","doi":"https://doi.org/10.2178/jsl/1231082313","title":"PDL with intersection and converse: satisfiability and infinite-state model checking","display_name":"PDL with intersection and converse: satisfiability and infinite-state model checking","publication_year":2009,"publication_date":"2009-01-04","ids":{"openalex":"https://openalex.org/W2019785612","doi":"https://doi.org/10.2178/jsl/1231082313","mag":"2019785612"},"language":"en","primary_location":{"id":"doi:10.2178/jsl/1231082313","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1231082313","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Symbolic Logic","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/A5079767975","display_name":"Stefan G\u00f6ller","orcid":"https://orcid.org/0000-0003-1747-1282"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan G\u00f6ller","raw_affiliation_strings":["Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Abteilung Algebraische und Logische Grundlagen der Informatik, Johannisgasse 26, 04103 Leipzig, Germany, E-mail: lohrey@informatik.uni-stuttgart.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Abteilung Algebraische und Logische Grundlagen der Informatik, Johannisgasse 26, 04103 Leipzig, Germany, E-mail: lohrey@informatik.uni-stuttgart.de","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[{"id":"https://openalex.org/I926574661","display_name":"Leipzig University","ror":"https://ror.org/03s7gtk40","country_code":"DE","type":"education","lineage":["https://openalex.org/I926574661"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":["Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Abteilung Algebraische und Logische Grundlagen der Informatik, Johannisgasse 26, 04103 Leipzig, Germany, E-mail: lohrey@informatik.uni-stuttgart.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e4t Leipzig, Institut f\u00fcr Informatik, Abteilung Algebraische und Logische Grundlagen der Informatik, Johannisgasse 26, 04103 Leipzig, Germany, E-mail: lohrey@informatik.uni-stuttgart.de","institution_ids":["https://openalex.org/I926574661"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034616829","display_name":"Carsten Lutz","orcid":"https://orcid.org/0000-0002-8791-6702"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Carsten Lutz","raw_affiliation_strings":["Dresden University of Technology, Institute for Theoretical Computer Science, Department of Computer Science, N\u00f6thnitzer Str. 46, 01062 Dresden, Germany, E-mail: lutz@tcs.inf.tu-dresden.de"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dresden University of Technology, Institute for Theoretical Computer Science, Department of Computer Science, N\u00f6thnitzer Str. 46, 01062 Dresden, Germany, E-mail: lutz@tcs.inf.tu-dresden.de","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2821,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.795877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"74","issue":"1","first_page":"279","last_page":"314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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.9911999702453613,"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.9901000261306763,"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/converse","display_name":"Converse","score":0.7011546492576599},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6611487865447998},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5475068092346191},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.5305027961730957},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5001652240753174},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.48586246371269226},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4808798134326935},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.4632969796657562},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4589996337890625},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4542262852191925},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4382805824279785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2894127070903778},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2582072615623474},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22242110967636108}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7011546492576599},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6611487865447998},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5475068092346191},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.5305027961730957},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5001652240753174},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.48586246371269226},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4808798134326935},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.4632969796657562},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4589996337890625},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4542262852191925},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4382805824279785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2894127070903778},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2582072615623474},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22242110967636108},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.2178/jsl/1231082313","is_oa":false,"landing_page_url":"https://doi.org/10.2178/jsl/1231082313","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1231082313","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1231082313","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.177.3011","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.177.3011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-bremen.de/%7Eclu/papers/archive/jsl08.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.329.4400","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.4400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.informatik.uni-bremen.de/~goeller/icpdl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.332.2879","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.332.2879","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://www.informatik.uni-leipzig.de/~lohrey/08-JSL.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":58,"referenced_works":["https://openalex.org/W23233230","https://openalex.org/W1501571921","https://openalex.org/W1511090187","https://openalex.org/W1540074953","https://openalex.org/W1555563750","https://openalex.org/W1557750304","https://openalex.org/W1577412708","https://openalex.org/W1600632836","https://openalex.org/W1658032593","https://openalex.org/W1748630121","https://openalex.org/W1754269820","https://openalex.org/W1809956864","https://openalex.org/W1963646041","https://openalex.org/W1971616901","https://openalex.org/W1982011272","https://openalex.org/W1995804042","https://openalex.org/W1996207810","https://openalex.org/W1997716585","https://openalex.org/W2033071128","https://openalex.org/W2041203617","https://openalex.org/W2044028378","https://openalex.org/W2060671215","https://openalex.org/W2066842490","https://openalex.org/W2068462394","https://openalex.org/W2069709605","https://openalex.org/W2083030304","https://openalex.org/W2088846354","https://openalex.org/W2101321886","https://openalex.org/W2112167310","https://openalex.org/W2113753582","https://openalex.org/W2114132089","https://openalex.org/W2117221156","https://openalex.org/W2117522142","https://openalex.org/W2117832390","https://openalex.org/W2123117474","https://openalex.org/W2124876285","https://openalex.org/W2128710701","https://openalex.org/W2140147652","https://openalex.org/W2146819619","https://openalex.org/W2151670874","https://openalex.org/W2163154038","https://openalex.org/W2271543169","https://openalex.org/W2336123333","https://openalex.org/W2340735175","https://openalex.org/W2530006810","https://openalex.org/W2720631021","https://openalex.org/W2737034859","https://openalex.org/W2905135108","https://openalex.org/W2913459036","https://openalex.org/W2989517397","https://openalex.org/W3022006420","https://openalex.org/W3140030144","https://openalex.org/W3146347964","https://openalex.org/W4210411973","https://openalex.org/W4239007999","https://openalex.org/W4241108585","https://openalex.org/W6629810137","https://openalex.org/W6667636780"],"related_works":["https://openalex.org/W52360167","https://openalex.org/W2170077473","https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W2091617677","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W4281812495","https://openalex.org/W1913543287"],"abstract_inverted_index":{"Abstract":[0],"We":[1,124],"study":[2],"satisfiability":[3,33,72,118],"and":[4,18,44,53,109],"infinite-state":[5,46,130],"model":[6,47,131],"checking":[7,48,132],"in":[8,35,73,119,122],"ICPDL,":[9,74],"which":[10],"extends":[11],"Propositional":[12],"Dynamic":[13],"Logic":[14],"(PDL)":[15],"with":[16],"intersection":[17],"converse":[19],"operators":[20],"on":[21,98],"programs.":[22],"The":[23],"two":[24],"main":[25],"results":[26],"of":[27,49,113,136],"this":[28,83],"paper":[29],"are":[30,62],"that":[31,78,117],"(i)":[32,104],"is":[34,56,87,121],"2\u0395\u03a7\u03a1\u03a4\u0399\u039c\u0395,":[36],"thus":[37],"2\u0395\u03a7\u03a1\u03a4\u0399\u039c\u0395-complete":[38],"by":[39,64],"an":[40,134],"existing":[41],"lower":[42,127],"bound,":[43],"(ii)":[45],"basic":[50],"process":[51],"algebras":[52],"pushdown":[54],"systems":[55],"also":[57,105],"2\u0395\u03a7\u03a1\u03a4\u0399\u039c\u0395-complete.":[58],"Both":[59],"upper":[60],"bounds":[61],"obtained":[63],"polynomial":[65],"time":[66],"computable":[67],"reductions":[68],"to":[69,90,103],"\u03c9-regular":[70],"tree":[71],"a":[75,107],"reasoning":[76],"problem":[77,86,93],"we":[79],"introduce":[80],"specifically":[81],"for":[82,94,129],"purpose.":[84],"This":[85],"then":[88],"reduced":[89],"the":[91,126],"emptiness":[92],"alternating":[95,137],"two-way":[96],"automata":[97],"infinite":[99],"trees.":[100],"Our":[101],"approach":[102],"provides":[106],"shorter":[108],"more":[110],"elegant":[111],"proof":[112],"Danecki's":[114],"difficult":[115],"result":[116],"IPDL":[120],"2\u0395\u03a7\u03a1\u03a4\u0399\u039c\u0395.":[123],"prove":[125],"bound(s)":[128],"using":[133],"encoding":[135],"Turing":[138],"machines.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}