{"id":"https://openalex.org/W2092618327","doi":"https://doi.org/10.2168/lmcs-8(3:20)2012","title":"Model-Checking of Ordered Multi-Pushdown Automata","display_name":"Model-Checking of Ordered Multi-Pushdown Automata","publication_year":2012,"publication_date":"2012-09-20","ids":{"openalex":"https://openalex.org/W2092618327","doi":"https://doi.org/10.2168/lmcs-8(3:20)2012","mag":"2092618327"},"language":"en","primary_location":{"id":"doi:10.2168/lmcs-8(3:20)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:20)2012","pdf_url":"https://lmcs.episciences.org/871/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/871/pdf","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":"Mohamed Faouzi Atig","raw_affiliation_strings":["San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","Uppsala University, Sweden","Uppsala University ,"],"affiliations":[{"raw_affiliation_string":"San Francisco, CA 94105, USA, or Eisenacher Strasse 2, 10777 Berlin, Germany","institution_ids":[]},{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]},{"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":2.7643,"has_fulltext":true,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90836804,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"Volume 8, 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.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/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"}},{"id":"https://openalex.org/T11549","display_name":"Synthetic Organic Chemistry Methods","score":0.98580002784729,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.9048123359680176},{"id":"https://openalex.org/keywords/deterministic-pushdown-automaton","display_name":"Deterministic pushdown automaton","score":0.8774797916412354},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.8220311403274536},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5510091781616211},{"id":"https://openalex.org/keywords/nested-word","display_name":"Nested word","score":0.5426069498062134},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5253861546516418},{"id":"https://openalex.org/keywords/context-free-language","display_name":"Context-free language","score":0.5243028402328491},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4507295787334442},{"id":"https://openalex.org/keywords/deterministic-context-free-grammar","display_name":"Deterministic context-free grammar","score":0.4489990472793579},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4478304982185364},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3758080303668976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32564789056777954},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.314073771238327},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.26219120621681213},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12701505422592163},{"id":"https://openalex.org/keywords/quantum-finite-automata","display_name":"Quantum finite automata","score":0.1157616674900055},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.11011067032814026},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.08683562278747559}],"concepts":[{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.9048123359680176},{"id":"https://openalex.org/C74919329","wikidata":"https://www.wikidata.org/wiki/Q378713","display_name":"Deterministic pushdown automaton","level":5,"score":0.8774797916412354},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.8220311403274536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5510091781616211},{"id":"https://openalex.org/C92117001","wikidata":"https://www.wikidata.org/wiki/Q6997829","display_name":"Nested word","level":5,"score":0.5426069498062134},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5253861546516418},{"id":"https://openalex.org/C198838072","wikidata":"https://www.wikidata.org/wiki/Q729271","display_name":"Context-free language","level":3,"score":0.5243028402328491},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4507295787334442},{"id":"https://openalex.org/C177638518","wikidata":"https://www.wikidata.org/wiki/Q3435975","display_name":"Deterministic context-free grammar","level":5,"score":0.4489990472793579},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4478304982185364},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3758080303668976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32564789056777954},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.314073771238327},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.26219120621681213},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12701505422592163},{"id":"https://openalex.org/C174327141","wikidata":"https://www.wikidata.org/wiki/Q176837","display_name":"Quantum finite automata","level":4,"score":0.1157616674900055},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.11011067032814026},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.08683562278747559},{"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.2168/lmcs-8(3:20)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:20)2012","pdf_url":"https://lmcs.episciences.org/871/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:1209.1916","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1209.1916","pdf_url":"https://arxiv.org/pdf/1209.1916","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.762.2089","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.762.2089","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/1209.1916.pdf","raw_type":"text"},{"id":"pmh:oai:doaj.org/article:40434fc75756473d8e85b3175131a825","is_oa":true,"landing_page_url":"https://doaj.org/article/40434fc75756473d8e85b3175131a825","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 8, Issue 3 (2012)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.2168/lmcs-8(3:20)2012","is_oa":true,"landing_page_url":"https://doi.org/10.2168/lmcs-8(3:20)2012","pdf_url":"https://lmcs.episciences.org/871/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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2092618327.pdf","grobid_xml":"https://content.openalex.org/works/W2092618327.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W115414801","https://openalex.org/W174890186","https://openalex.org/W1491036809","https://openalex.org/W1493367105","https://openalex.org/W1496958170","https://openalex.org/W1522637167","https://openalex.org/W1526231760","https://openalex.org/W1530940145","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/W1911833263","https://openalex.org/W1933255669","https://openalex.org/W1976043843","https://openalex.org/W2019881090","https://openalex.org/W2023808162","https://openalex.org/W2060345611","https://openalex.org/W2099608328","https://openalex.org/W2100532597","https://openalex.org/W2101936540","https://openalex.org/W2107398710","https://openalex.org/W2109819183","https://openalex.org/W2117842469","https://openalex.org/W2119006541","https://openalex.org/W2143502475","https://openalex.org/W2147248565","https://openalex.org/W2148778089","https://openalex.org/W2151906265","https://openalex.org/W2155756511","https://openalex.org/W2156883715","https://openalex.org/W2177564498","https://openalex.org/W2912538643","https://openalex.org/W4214848047","https://openalex.org/W4230104298","https://openalex.org/W4230480080","https://openalex.org/W4236838373","https://openalex.org/W4301322018","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W2067895928","https://openalex.org/W2472752294","https://openalex.org/W127918926","https://openalex.org/W1486486721","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,76],"address":[1],"the":[2,32,40,59,82,89,111,125],"verification":[3],"problem":[4,42,127],"of":[5,12,61,64,68,91,94,128],"ordered":[6,44,56,96,132],"multi-pushdown":[7,45,57,97,133],"automata:":[8],"A":[9],"multi-stack":[10],"extension":[11],"pushdown":[13],"automata":[14,46,134],"that":[15,24,39,99],"comes":[16],"with":[17],"a":[18,25,65,101],"constraint":[19],"on":[20,31],"stack":[21],"transitions":[22],"such":[23],"pop":[26],"can":[27],"only":[28],"be":[29],"performed":[30],"first":[33],"non-empty":[34],"stack.":[35],"First,":[36],"we":[37,51,118],"show":[38],"emptiness":[41],"for":[43,54,124,131],"is":[47,70],"in":[48,87,106],"2ETIME.":[49],"Then,":[50],"prove":[52],"that,":[53],"an":[55,71,95,115,120],"automata,":[58],"set":[60,67,90],"all":[62,92],"predecessors":[63],"regular":[66,74],"configurations":[69,93],"effectively":[72],"constructible":[73],"set.":[75],"exploit":[77],"this":[78],"result":[79],"to":[80],"solve":[81],"global":[83],"model-checking":[84,126],"which":[85],"consists":[86],"computing":[88],"automaton":[98],"satisfy":[100],"given":[102],"w-regular":[103,129],"property":[104],"(expressible":[105],"linear-time":[107,112],"temporal":[108],"logics":[109],"or":[110],"\\mu-calculus).":[113],"As":[114],"immediate":[116],"consequence,":[117],"obtain":[119],"2ETIME":[121],"upper":[122],"bound":[123],"properties":[130],"(matching":[135],"its":[136],"lower-bound).":[137]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}