{"id":"https://openalex.org/W4230386512","doi":"https://doi.org/10.1109/lics.2017.8005083","title":"Timed pushdown automata and branching vector addition systems","display_name":"Timed pushdown automata and branching vector addition systems","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W4230386512","doi":"https://doi.org/10.1109/lics.2017.8005083"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2017.8005083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-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/A5074542253","display_name":"Lorenzo Clemente","orcid":"https://orcid.org/0000-0003-0578-9103"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Lorenzo Clemente","raw_affiliation_strings":["Faculty of Mathematics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102789796","display_name":"S\u0142awomir Lasota","orcid":"https://orcid.org/0000-0001-8674-4470"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Slawomir Lasota","raw_affiliation_strings":["Faculty of Mathematics, University of Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016064325","display_name":"Ranko Lazi\u0107","orcid":"https://orcid.org/0000-0003-3663-5182"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Ranko Lazic","raw_affiliation_strings":["DIMAP, University of Warwick, UK"],"affiliations":[{"raw_affiliation_string":"DIMAP, University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004165473","display_name":"Filip Mazowiecki","orcid":"https://orcid.org/0000-0002-4535-6508"},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Filip Mazowiecki","raw_affiliation_strings":["DIMAP, University of Warwick, UK"],"affiliations":[{"raw_affiliation_string":"DIMAP, University of Warwick, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074542253"],"corresponding_institution_ids":["https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":0.4542,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69044006,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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.9952999949455261,"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/decidability","display_name":"Decidability","score":0.7351019382476807},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7347474694252014},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7216487526893616},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.637127161026001},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.5626609325408936},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.538200855255127},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5195106267929077},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5093918442726135},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.47693151235580444},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.4698936939239502},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.45471546053886414},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.4292789101600647},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3961179256439209},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39455562829971313},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.33224695920944214},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.27597251534461975},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23853981494903564},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19751113653182983},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.12883681058883667},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.0935584306716919},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.07699435949325562}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7351019382476807},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7347474694252014},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7216487526893616},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.637127161026001},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.5626609325408936},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.538200855255127},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5195106267929077},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5093918442726135},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.47693151235580444},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.4698936939239502},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.45471546053886414},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.4292789101600647},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3961179256439209},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39455562829971313},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.33224695920944214},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.27597251534461975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23853981494903564},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19751113653182983},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.12883681058883667},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.0935584306716919},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.07699435949325562},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lics.2017.8005083","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2017.8005083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)","raw_type":"proceedings-article"},{"id":"pmh:oai:wrap.warwick.ac.uk:87987","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3115221019","display_name":null,"funder_award_id":"EP/M011801/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1520239064","https://openalex.org/W1524026935","https://openalex.org/W1559258652","https://openalex.org/W1593799327","https://openalex.org/W1880663844","https://openalex.org/W1976426006","https://openalex.org/W2101508170","https://openalex.org/W2108820019","https://openalex.org/W2133514269","https://openalex.org/W2154949534","https://openalex.org/W2157757085","https://openalex.org/W2160827412","https://openalex.org/W2221764640","https://openalex.org/W2254602659","https://openalex.org/W2279198882","https://openalex.org/W2344990015","https://openalex.org/W2552818849","https://openalex.org/W2612695319","https://openalex.org/W2952380278","https://openalex.org/W2963717612","https://openalex.org/W6692037359","https://openalex.org/W6705138038","https://openalex.org/W6729798396","https://openalex.org/W6737652122"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W127918926","https://openalex.org/W2089141720","https://openalex.org/W214992615","https://openalex.org/W2049492436","https://openalex.org/W4206600150","https://openalex.org/W2400175085","https://openalex.org/W2116448069"],"abstract_inverted_index":{"We":[0],"prove":[1,65],"that":[2],"non-emptiness":[3,74],"of":[4,21,40,47,57,70,75,80,84],"timed":[5,38,53],"register":[6,54],"pushdown":[7,37,45,55],"automata":[8,39,46,56],"is":[9,16],"decidable":[10],"in":[11,98,109],"doubly":[12],"exponential":[13,110],"time.":[14,111],"This":[15],"a":[17],"very":[18],"expressive":[19],"class":[20],"automata,":[22],"whose":[23],"transitions":[24],"may":[25],"involve":[26],"state":[27],"and":[28,51,59,89,93,95,106],"top-of-stack":[29],"clocks":[30],"with":[31,86,91,104],"unbounded":[32],"differences.":[33],"It":[34],"strictly":[35],"subsumes":[36],"Bouajjani":[41],"et":[42,49],"al.,":[43,50],"dense-timed":[44],"Abdulla":[48],"orbit-finite":[52],"Clemente":[58],"Lasota.":[60],"Along":[61],"the":[62],"way,":[63],"we":[64],"two":[66],"further":[67],"decidability":[68],"results":[69],"independent":[71],"interest:":[72],"for":[73,96],"least":[76],"solutions":[77],"to":[78],"systems":[79,103],"equations":[81],"over":[82],"sets":[83],"integers":[85],"addition,":[87],"union":[88],"intersections":[90],"\u2115":[92],"-\u2115,":[94],"reachability":[97],"one-dimensional":[99],"branching":[100],"vector":[101],"addition":[102],"states":[105],"subtraction,":[107],"both":[108]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}