{"id":"https://openalex.org/W2763333357","doi":"https://doi.org/10.2168/lmcs-11(3:20)2015","title":"Verification for Timed Automata extended with Unbounded Discrete Data Structures","display_name":"Verification for Timed Automata extended with Unbounded Discrete Data Structures","publication_year":2015,"publication_date":"2015-09-22","ids":{"openalex":"https://openalex.org/W2763333357","doi":"https://doi.org/10.2168/lmcs-11(3:20)2015","mag":"2763333357"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-11(3:20)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(3:20)2015","pdf_url":"https://lmcs.episciences.org/1596/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":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/1596/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066136949","display_name":"Karin Quaas","orcid":null},"institutions":[{"id":"https://openalex.org/I147765834","display_name":"Leipzig University of Applied Sciences","ror":"https://ror.org/03xgcq477","country_code":"DE","type":"education","lineage":["https://openalex.org/I147765834"]},{"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":true,"raw_author_name":"Karin Quaas","raw_affiliation_strings":["San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","Universitt Leipzig, Germany","University of Leipzig"],"affiliations":[{"raw_affiliation_string":"San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","institution_ids":[]},{"raw_affiliation_string":"Universitt Leipzig, Germany","institution_ids":["https://openalex.org/I147765834","https://openalex.org/I926574661"]},{"raw_affiliation_string":"University of Leipzig","institution_ids":["https://openalex.org/I926574661"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5066136949"],"corresponding_institution_ids":["https://openalex.org/I147765834","https://openalex.org/I926574661"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.26881079,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 11, 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":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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9969000220298767,"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/T12423","display_name":"Software Reliability and Analysis Research","score":0.9958999752998352,"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/decidability","display_name":"Decidability","score":0.907137393951416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7617675065994263},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.713126540184021},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6666548848152161},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6272073984146118},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6188175678253174},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.55450040102005},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49372658133506775},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.4748958647251129},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4517173767089844},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.434995174407959},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3961176872253418},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3756210505962372},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3692649006843567},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.3478628695011139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21072745323181152},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.13685691356658936},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.09415245056152344}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.907137393951416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7617675065994263},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.713126540184021},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6666548848152161},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6272073984146118},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6188175678253174},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.55450040102005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49372658133506775},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.4748958647251129},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4517173767089844},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.434995174407959},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3961176872253418},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3756210505962372},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3692649006843567},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.3478628695011139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21072745323181152},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.13685691356658936},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.09415245056152344},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-11(3:20)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(3:20)2015","pdf_url":"https://lmcs.episciences.org/1596/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:1403.6303","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1403.6303","pdf_url":"https://arxiv.org/pdf/1403.6303","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":"pmh:oai:CiteSeerX.psu:10.1.1.758.8796","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.758.8796","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1403.6303.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:0db1ea88824e4e73993000e2b78db94f","is_oa":true,"landing_page_url":"https://doaj.org/article/0db1ea88824e4e73993000e2b78db94f","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 11, Issue 3 (2015)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-11(3:20)2015","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-11(3:20)2015","pdf_url":"https://lmcs.episciences.org/1596/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":[{"score":0.7900000214576721,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2763333357.pdf","grobid_xml":"https://content.openalex.org/works/W2763333357.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W16323886","https://openalex.org/W1482486776","https://openalex.org/W1569998753","https://openalex.org/W1580995538","https://openalex.org/W1596041124","https://openalex.org/W1738870074","https://openalex.org/W1746460710","https://openalex.org/W1763049863","https://openalex.org/W1775249002","https://openalex.org/W1823282488","https://openalex.org/W1853387130","https://openalex.org/W1903088707","https://openalex.org/W1925933118","https://openalex.org/W1964297656","https://openalex.org/W1965755333","https://openalex.org/W1983125523","https://openalex.org/W1987814265","https://openalex.org/W1990497675","https://openalex.org/W2021255060","https://openalex.org/W2026927709","https://openalex.org/W2036684363","https://openalex.org/W2076508310","https://openalex.org/W2085384188","https://openalex.org/W2092008211","https://openalex.org/W2101508170","https://openalex.org/W2116411132","https://openalex.org/W2116930279","https://openalex.org/W2127101272","https://openalex.org/W2128090891","https://openalex.org/W2133514269","https://openalex.org/W2134059826","https://openalex.org/W2141489446","https://openalex.org/W2148906857","https://openalex.org/W2151033407","https://openalex.org/W2153273838","https://openalex.org/W2167668895","https://openalex.org/W2177814128","https://openalex.org/W2276770679","https://openalex.org/W2316437449","https://openalex.org/W2951631352","https://openalex.org/W4212852471","https://openalex.org/W4245473887"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W1976426006","https://openalex.org/W2182165215","https://openalex.org/W2513316208","https://openalex.org/W2266924268","https://openalex.org/W2103587987","https://openalex.org/W4294226097","https://openalex.org/W1563348382","https://openalex.org/W428839547"],"abstract_inverted_index":{"We":[0],"study":[1],"decidability":[2],"of":[3,61,68],"verification":[4],"problems":[5,80],"for":[6,35,54,72],"timed":[7,19,69],"automata":[8,20,71],"extended":[9],"with":[10,21,43],"unbounded":[11],"discrete":[12],"data":[13],"structures.":[14],"More":[15],"detailed,":[16],"we":[17,28],"extend":[18],"a":[22,30],"pushdown":[23,70],"stack.":[24],"In":[25],"this":[26,55,62],"way,":[27],"obtain":[29],"strong":[31],"model":[32,40,56],"that":[33,50],"may":[34],"instance":[36],"be":[37],"used":[38],"to":[39,65],"real-time":[41],"programs":[42],"procedure":[44],"calls.":[45],"It":[46],"is":[47,57,64],"long":[48],"known":[49],"the":[51,74],"reachability":[52],"problem":[53,77],"decidable.":[58,82],"The":[59],"goal":[60],"paper":[63],"identify":[66],"subclasses":[67],"which":[73],"language":[75],"inclusion":[76],"and":[78],"related":[79],"are":[81]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}