{"id":"https://openalex.org/W1568608011","doi":"https://doi.org/10.1007/978-3-319-04921-2_5","title":"Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata","display_name":"Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W1568608011","doi":"https://doi.org/10.1007/978-3-319-04921-2_5","mag":"1568608011"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-04921-2_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04921-2_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047278328","display_name":"Mohamed Faouzi Atig","orcid":"https://orcid.org/0000-0001-8229-3481"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mohamed Faouzi Atig","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068887546","display_name":"Jari Stenman","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Jari Stenman","raw_affiliation_strings":["Dept. of Information Technology, Uppsala University, Sweden"],"affiliations":[{"raw_affiliation_string":"Dept. of Information Technology, Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5002478680"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.798,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72628835,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"62","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T11567","display_name":"semigroups and automata theory","score":0.9983999729156494,"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.9950000047683716,"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/pushdown-automaton","display_name":"Pushdown automaton","score":0.84489506483078},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7876480221748352},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7483068704605103},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.6861498951911926},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6671544313430786},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6637696027755737},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.46903929114341736},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.4668945074081421},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45830607414245605},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.4581325352191925},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.45580625534057617},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43402713537216187},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4340081810951233},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.41683605313301086},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4161006808280945},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3414040803909302},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31587713956832886},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2824555039405823},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2623993456363678},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2392084002494812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14326107501983643},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.11752703785896301}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.84489506483078},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7876480221748352},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7483068704605103},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.6861498951911926},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6671544313430786},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6637696027755737},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.46903929114341736},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.4668945074081421},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45830607414245605},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.4581325352191925},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.45580625534057617},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43402713537216187},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4340081810951233},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.41683605313301086},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4161006808280945},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3414040803909302},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31587713956832886},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2824555039405823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2623993456363678},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2392084002494812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14326107501983643},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.11752703785896301},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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},{"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/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-04921-2_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-04921-2_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.646.6476","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.6476","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://user.it.uu.se/~parosh/publications/papers/lata2014.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W163324349","https://openalex.org/W1522448884","https://openalex.org/W1589224558","https://openalex.org/W1880663844","https://openalex.org/W1882239865","https://openalex.org/W1921404173","https://openalex.org/W1976426006","https://openalex.org/W2056957549","https://openalex.org/W2065323166","https://openalex.org/W2089017767","https://openalex.org/W2097118908","https://openalex.org/W2101508170","https://openalex.org/W2106001218","https://openalex.org/W2123910665","https://openalex.org/W2128090891","https://openalex.org/W2503611065"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W1991406344","https://openalex.org/W2049492436","https://openalex.org/W179750864","https://openalex.org/W1511257926","https://openalex.org/W2472752294","https://openalex.org/W1486486721","https://openalex.org/W1976426006","https://openalex.org/W2513316208","https://openalex.org/W1563348382"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}