{"id":"https://openalex.org/W2157323715","doi":"https://doi.org/10.23638/lmcs-13(3:19)2017","title":"Path Checking for MTL and TPTL over Data Words","display_name":"Path Checking for MTL and TPTL over Data Words","publication_year":2017,"publication_date":"2017-09-04","ids":{"openalex":"https://openalex.org/W2157323715","doi":"https://doi.org/10.23638/lmcs-13(3:19)2017","mag":"2157323715"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(3:19)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:19)2017","pdf_url":"https://lmcs.episciences.org/3898/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3898/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013723834","display_name":"Shiguang Feng","orcid":"https://orcid.org/0000-0002-5110-3881"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shiguang Feng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005500210","display_name":"Markus Lohrey","orcid":"https://orcid.org/0000-0002-4680-7198"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Markus Lohrey","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066136949","display_name":"Karin Quaas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karin Quaas","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013723834"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00431694,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 13, Issue 3","issue":null,"first_page":null,"last_page":null},"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.9962999820709229,"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.9922999739646912,"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/unary-operation","display_name":"Unary operation","score":0.819250226020813},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.7215681076049805},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.6533029675483704},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6129840612411499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5152238011360168},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4688454866409302},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4665515124797821},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44587141275405884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4416097402572632},{"id":"https://openalex.org/keywords/linear-temporal-logic","display_name":"Linear temporal logic","score":0.4354098439216614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43091708421707153},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3160673975944519},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09978759288787842}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.819250226020813},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.7215681076049805},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.6533029675483704},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6129840612411499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5152238011360168},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4688454866409302},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4665515124797821},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44587141275405884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4416097402572632},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.4354098439216614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43091708421707153},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3160673975944519},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09978759288787842},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(3:19)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:19)2017","pdf_url":"https://lmcs.episciences.org/3898/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1412.3644","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1412.3644","pdf_url":"https://arxiv.org/pdf/1412.3644","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1412.3644","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1412.3644","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(3:19)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:19)2017","pdf_url":"https://lmcs.episciences.org/3898/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1913145437","display_name":null,"funder_award_id":"QU 316/1-2","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6819048190","display_name":null,"funder_award_id":"GRK 1763","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2157323715.pdf","grobid_xml":"https://content.openalex.org/works/W2157323715.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1527197079","https://openalex.org/W1532209667","https://openalex.org/W1562978104","https://openalex.org/W1570669451","https://openalex.org/W1580995538","https://openalex.org/W1602151432","https://openalex.org/W1816892670","https://openalex.org/W1955197180","https://openalex.org/W1990151088","https://openalex.org/W2011039300","https://openalex.org/W2024091095","https://openalex.org/W2026629052","https://openalex.org/W2030263557","https://openalex.org/W2050398281","https://openalex.org/W2058579816","https://openalex.org/W2099040330","https://openalex.org/W2139891885","https://openalex.org/W2161137818","https://openalex.org/W2276770679","https://openalex.org/W2293722038","https://openalex.org/W2951811830","https://openalex.org/W2962748292"],"related_works":["https://openalex.org/W2124110813","https://openalex.org/W2084686863","https://openalex.org/W1551070491","https://openalex.org/W2034301573","https://openalex.org/W3021103820","https://openalex.org/W2763487042","https://openalex.org/W2350953867","https://openalex.org/W1592102986","https://openalex.org/W2477338659","https://openalex.org/W1967076997"],"abstract_inverted_index":{"Metric":[0],"temporal":[1,7,15],"logic":[2,8],"(MTL)":[3],"and":[4,20,67,112,160],"timed":[5,44],"propositional":[6],"(TPTL)":[9],"are":[10,18],"quantitative":[11],"extensions":[12],"of":[13,26,87,98,101,109,115,150,158],"linear":[14],"logic,":[16],"which":[17],"prominent":[19],"widely":[21],"used":[22],"in":[23,47],"the":[24,34,48,62,76,85,99,102,107,113,122,129,137,147],"verification":[25],"real-timed":[27],"systems.":[28],"It":[29],"was":[30],"recently":[31],"shown":[32],"that":[33,128],"path":[35],"checking":[36,152],"problem":[37,64,104,131,139],"for":[38,61,65,132,140],"MTL,":[39],"when":[40,69],"evaluated":[41,70],"over":[42,71,75],"finite":[43],"words,":[45],"is":[46,134,142],"parallel":[49],"complexity":[50,59,100,149],"class":[51],"NC.":[52],"In":[53],"this":[54,91],"paper,":[55],"we":[56,93,126],"derive":[57],"precise":[58,148],"results":[60,145],"path-checking":[63,103,130,138],"MTL":[66,133,159],"TPTL":[68,141],"infinite":[72],"data":[73],"words":[74,80],"non-negative":[77],"integers.":[78],"Such":[79],"may":[81],"be":[82],"seen":[83],"as":[84],"behaviours":[86],"one-counter":[88,154],"machines.":[89],"For":[90],"setting,":[92],"give":[94],"a":[95],"complete":[96],"analysis":[97],"depending":[105],"on":[106],"number":[108],"register":[110],"variables":[111],"encoding":[114],"constraint":[116],"numbers":[117],"(unary":[118],"or":[119],"binary).":[120],"As":[121],"two":[123],"main":[124],"results,":[125],"prove":[127],"P-complete,":[135],"whereas":[136],"PSPACE-complete.":[143],"The":[144],"yield":[146],"model":[151],"deterministic":[153],"machines":[155],"against":[156],"formulae":[157],"TPTL.":[161]},"counts_by_year":[],"updated_date":"2026-03-21T08:13:44.787528","created_date":"2025-10-10T00:00:00"}