{"id":"https://openalex.org/W2764296810","doi":"https://doi.org/10.1007/1-4020-8141-3_31","title":"A Generic Framework for Checking Semantic Equivalences Between Pushdown Automata and Finite-State Automata","display_name":"A Generic Framework for Checking Semantic Equivalences Between Pushdown Automata and Finite-State Automata","publication_year":2006,"publication_date":"2006-02-21","ids":{"openalex":"https://openalex.org/W2764296810","doi":"https://doi.org/10.1007/1-4020-8141-3_31","mag":"2764296810"},"language":"en","primary_location":{"id":"doi:10.1007/1-4020-8141-3_31","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_31","pdf_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_31.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_31.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019575165","display_name":"Anton\u0131\u0301n Ku\u010dera","orcid":"https://orcid.org/0000-0002-6602-8028"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Antonin Ku\u010dera","raw_affiliation_strings":["Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Faculty of Informatics, Masaryk University, Botanick\u00e1 68a, 60200, Brno, Czech Republic","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Richard Mayr","raw_affiliation_strings":["Department of Computer Science, Albert-Ludwigs-University Freiburg, Georges-Koehler-Allee 51, D-79110, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Albert-Ludwigs-University Freiburg, Georges-Koehler-Allee 51, D-79110, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019575165"],"corresponding_institution_ids":["https://openalex.org/I21449261"],"apc_list":null,"apc_paid":null,"fwci":1.9847,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8636754,"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":"395","last_page":"408"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/bisimulation","display_name":"Bisimulation","score":0.7173225283622742},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6141530871391296},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.5697560906410217},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5272825360298157},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5059744715690613},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4984109401702881},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.486563116312027},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38192081451416016},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3544808626174927},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2942742109298706}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.7173225283622742},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6141530871391296},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.5697560906410217},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5272825360298157},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5059744715690613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4984109401702881},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.486563116312027},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38192081451416016},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3544808626174927},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2942742109298706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/1-4020-8141-3_31","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_31","pdf_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_31.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/1-4020-8141-3_31","is_oa":true,"landing_page_url":"https://doi.org/10.1007/1-4020-8141-3_31","pdf_url":"https://link.springer.com/content/pdf/10.1007/1-4020-8141-3_31.pdf","source":{"id":"https://openalex.org/S4306463519","display_name":"Kluwer Academic Publishers eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308269","display_name":"Alexander von Humboldt-Stiftung","ror":"https://ror.org/012kf4317"},{"id":"https://openalex.org/F4320310414","display_name":"Baden-W\u00fcrttemberg Stiftung","ror":"https://ror.org/031h5fa94"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2764296810.pdf","grobid_xml":"https://content.openalex.org/works/W2764296810.grobid-xml"},"referenced_works_count":44,"referenced_works":["https://openalex.org/W173099331","https://openalex.org/W1491036809","https://openalex.org/W1501673292","https://openalex.org/W1503973138","https://openalex.org/W1514446453","https://openalex.org/W1532207056","https://openalex.org/W1547562281","https://openalex.org/W1555553717","https://openalex.org/W1556566737","https://openalex.org/W1560595963","https://openalex.org/W1585666806","https://openalex.org/W1589224558","https://openalex.org/W1591409444","https://openalex.org/W1604199524","https://openalex.org/W1604983619","https://openalex.org/W1607820520","https://openalex.org/W1760894569","https://openalex.org/W1780977260","https://openalex.org/W1839623074","https://openalex.org/W1879730986","https://openalex.org/W1965551437","https://openalex.org/W1976268573","https://openalex.org/W1977601940","https://openalex.org/W1985161650","https://openalex.org/W2005406695","https://openalex.org/W2008587618","https://openalex.org/W2048783134","https://openalex.org/W2051521505","https://openalex.org/W2078050093","https://openalex.org/W2098737431","https://openalex.org/W2098981343","https://openalex.org/W2114132089","https://openalex.org/W2118539487","https://openalex.org/W2136937307","https://openalex.org/W2142944765","https://openalex.org/W2147830331","https://openalex.org/W2158487182","https://openalex.org/W2172111426","https://openalex.org/W2571430288","https://openalex.org/W2912614885","https://openalex.org/W2955084936","https://openalex.org/W2987106766","https://openalex.org/W3000511677","https://openalex.org/W4244719572"],"related_works":["https://openalex.org/W1586382855","https://openalex.org/W1569743961","https://openalex.org/W2604841551","https://openalex.org/W2089409100","https://openalex.org/W1968437296","https://openalex.org/W2008367893","https://openalex.org/W2162510824","https://openalex.org/W4388327463","https://openalex.org/W2280116234","https://openalex.org/W127357700"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,29],"generic":[3],"method":[4,20,37,75,98,114],"for":[5],"deciding":[6],"semantic":[7],"equivalences":[8,42,59],"between":[9],"pushdown":[10],"automata":[11],"and":[12,65,68,79,102],"finite-state":[13],"automata.":[14],"The":[15,82,106],"abstract":[16],"part":[17],"of":[18,35,47,90,108,120],"the":[19,36,48,74,88,92],"is":[21,28,38,55,70],"applicable":[22],"to":[23,57,77,87],"every":[24],"process":[25],"equivalence":[26],"which":[27,43,117],"right":[30],"PDA":[31],"congruence.":[32],"Practical":[33],"usability":[34],"demonstrated":[39],"on":[40],"selected":[41],"are":[44,99,118],"conceptual":[45],"representatives":[46],"whole":[49],"spectrum.":[50],"In":[51],"particular,":[52],"special":[53],"attention":[54],"devoted":[56],"bisimulation-like":[58],"(including":[60],"weak,":[61],"early,":[62],"delay,":[63],"branching,":[64],"probabilistic":[66],"bisimilarity),":[67],"it":[69],"also":[71],"shown":[72],"how":[73],"applies":[76],"simulation-like":[78],"trace-like":[80],"equivalences.":[81],"generality":[83],"does":[84],"not":[85],"lead":[86],"loss":[89],"efficiency;":[91],"algorithms":[93],"obtained":[94,111],"by":[95,112],"applying":[96],"our":[97,113],"essentially":[100],"time-optimal":[101],"sometimes":[103],"even":[104],"polynomial.":[105],"list":[107],"particular":[109],"results":[110],"includes":[115],"items":[116],"first":[119],"their":[121],"kind.":[122]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}