{"id":"https://openalex.org/W2134126189","doi":"https://doi.org/10.1007/978-3-642-04420-5_13","title":"Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order","display_name":"Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2134126189","doi":"https://doi.org/10.1007/978-3-642-04420-5_13","mag":"2134126189"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-04420-5_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04420-5_13","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":"conference-paper","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/A5019390358","display_name":"Denis Lugiez","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Denis Lugiez","raw_affiliation_strings":["LIF UMR 6166 Aix-Marseille Universit\u00e9- CNRS, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIF UMR 6166 Aix-Marseille Universit\u00e9- CNRS, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019390358"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I21491767"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2437,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.51174009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"127","last_page":"140"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994999766349792,"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/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7968347072601318},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6741451621055603},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6447355151176453},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5876290798187256},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5309217572212219},{"id":"https://openalex.org/keywords/tree-automaton","display_name":"Tree automaton","score":0.5077122449874878},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4815683364868164},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45515650510787964},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4211188852787018},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.23045483231544495}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7968347072601318},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6741451621055603},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6447355151176453},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5876290798187256},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5309217572212219},{"id":"https://openalex.org/C2778583254","wikidata":"https://www.wikidata.org/wiki/Q2872598","display_name":"Tree automaton","level":3,"score":0.5077122449874878},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4815683364868164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45515650510787964},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4211188852787018},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.23045483231544495}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-04420-5_13","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-04420-5_13","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.156.4822","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.4822","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lif.univ-mrs.fr/~lugiez/Recherche/Publis/RR-RP09.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":20,"referenced_works":["https://openalex.org/W125988503","https://openalex.org/W1530940145","https://openalex.org/W1551108348","https://openalex.org/W1556056959","https://openalex.org/W1561190901","https://openalex.org/W1589224558","https://openalex.org/W1964874178","https://openalex.org/W2008958263","https://openalex.org/W2035561341","https://openalex.org/W2038216124","https://openalex.org/W2117842469","https://openalex.org/W2147248565","https://openalex.org/W2157148396","https://openalex.org/W2770491639","https://openalex.org/W2914098457","https://openalex.org/W4205625588","https://openalex.org/W4230104298","https://openalex.org/W4232505977","https://openalex.org/W4285719527","https://openalex.org/W4301322018"],"related_works":["https://openalex.org/W2150468037","https://openalex.org/W2032269072","https://openalex.org/W1989788631","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W4288581691","https://openalex.org/W1999231617","https://openalex.org/W2099490078","https://openalex.org/W2506746226","https://openalex.org/W2130664212"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}