{"id":"https://openalex.org/W2151906265","doi":"https://doi.org/10.4230/lipics.fsttcs.2010.216","title":"Global Model Checking of Ordered Multi-Pushdown Systems","display_name":"Global Model Checking of Ordered Multi-Pushdown Systems","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2151906265","doi":"https://doi.org/10.4230/lipics.fsttcs.2010.216","mag":"2151906265"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:2865","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.216","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.fsttcs.2010.216","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Atig, Mohamed Faouzi","raw_affiliation_strings":["Uppsala University"],"affiliations":[{"raw_affiliation_string":"Uppsala University","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047278328"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":5.4662,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.96134373,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":null,"first_page":"216","last_page":"227"},"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/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.9896000027656555,"subfield":{"id":"https://openalex.org/subfields/1605","display_name":"Organic Chemistry"},"field":{"id":"https://openalex.org/fields/16","display_name":"Chemistry"},"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.9868000149726868,"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/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.7368183732032776},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.6493334770202637},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.6433485150337219},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.6049870848655701},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5736861228942871},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5003557205200195},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49747970700263977},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.4689856171607971},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.457495778799057},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.4496229588985443},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40745773911476135},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3827967047691345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36002111434936523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.338308721780777},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.15380403399467468},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14951902627944946},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.10409674048423767},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.05951771140098572}],"concepts":[{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.7368183732032776},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.6493334770202637},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.6433485150337219},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.6049870848655701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5736861228942871},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5003557205200195},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49747970700263977},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.4689856171607971},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.457495778799057},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.4496229588985443},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40745773911476135},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3827967047691345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36002111434936523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.338308721780777},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.15380403399467468},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14951902627944946},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.10409674048423767},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.05951771140098572},{"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},{"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},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:2865","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2010.216","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.371.8980","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.371.8980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://drops.dagstuhl.de/opus/volltexte/2010/2865/pdf/19.pdf","raw_type":"text"},{"id":"doi:10.4230/lipics.fsttcs.2010.216","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2010.216","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":""},{"id":"mag:2151906265","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2010/2865/pdf/19.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418453","display_name":"Foundations of Software Technology and Theoretical Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Foundations of Software Technology and Theoretical Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.4230/lipics.fsttcs.2010.216","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fsttcs.2010.216","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W42364276","https://openalex.org/W1493367105","https://openalex.org/W1496958170","https://openalex.org/W1522637167","https://openalex.org/W1526231760","https://openalex.org/W1554834491","https://openalex.org/W1560595963","https://openalex.org/W1563374799","https://openalex.org/W1589224558","https://openalex.org/W1603445208","https://openalex.org/W1823865466","https://openalex.org/W1842117537","https://openalex.org/W1878430332","https://openalex.org/W1905205673","https://openalex.org/W1976043843","https://openalex.org/W2023808162","https://openalex.org/W2060345611","https://openalex.org/W2100532597","https://openalex.org/W2107398710","https://openalex.org/W2117842469","https://openalex.org/W2119006541","https://openalex.org/W2147248565","https://openalex.org/W2155756511","https://openalex.org/W2156883715","https://openalex.org/W2177564498","https://openalex.org/W2720631021","https://openalex.org/W2770491639"],"related_works":["https://openalex.org/W1493367105","https://openalex.org/W2107398710","https://openalex.org/W1603445208","https://openalex.org/W174890186","https://openalex.org/W2165546792","https://openalex.org/W2100532597","https://openalex.org/W1556566737","https://openalex.org/W1589224558","https://openalex.org/W1842117537","https://openalex.org/W153330214","https://openalex.org/W2122095746","https://openalex.org/W2063156356","https://openalex.org/W2023808162","https://openalex.org/W2336535781","https://openalex.org/W2145494365","https://openalex.org/W2131886132","https://openalex.org/W1878430332","https://openalex.org/W1602322980","https://openalex.org/W1493722247","https://openalex.org/W8705220"],"abstract_inverted_index":{"In":[0],"this":[1,68,110],"paper,":[2],"we":[3,40,66,112],"address":[4],"the":[5,35,48,72,80,102,119],"verification":[6],"problem":[7,122],"of":[8,15,50,53,57,82,85,109,123],"ordered":[9,45,87,127],"multi-pushdown":[10,46,88,128],"systems:":[11],"A":[12],"multi-stack":[13],"extension":[14],"pushdown":[16],"systems":[17,129],"that":[18,27,42,90],"comes":[19],"with":[20],"a":[21,28,54,92],"constraint":[22],"on":[23,34],"stack":[24],"operations":[25],"such":[26],"pop":[29],"can":[30],"only":[31],"be":[32],"performed":[33],"first":[36],"non-empty":[37],"stack.":[38],"First,":[39],"show":[41],"for":[43,118,126],"an":[44,60,86,106,114],"system":[47,89],"set":[49,56,81],"all":[51,83],"predecessors":[52],"regular":[55,63],"configurations":[58,84],"is":[59],"effectively":[61],"constructible":[62],"set.":[64],"Then,":[65],"exploit":[67],"result":[69],"to":[70],"solve":[71],"global":[73],"model":[74,120],"checking":[75,121],"which":[76],"consists":[77],"in":[78,97],"computing":[79],"satisfy":[91],"given":[93],"$w$-regular":[94,124],"property":[95],"(expressible":[96],"linear-time":[98,103],"temporal":[99],"logics":[100],"or":[101],"$\\mu$-calculus).":[104],"As":[105],"immediate":[107],"consequence":[108],"result,":[111],"obtain":[113],"2ETIME":[115],"upper":[116],"bound":[117],"properties":[125],"(matching":[130],"its":[131],"lower-bound).":[132]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}