{"id":"https://openalex.org/W89384568","doi":"https://doi.org/10.1007/978-3-642-38592-6_16","title":"Asynchronously Communicating Visibly Pushdown Systems","display_name":"Asynchronously Communicating Visibly Pushdown Systems","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W89384568","doi":"https://doi.org/10.1007/978-3-642-38592-6_16","mag":"89384568"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-38592-6_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38592-6_16","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":true,"oa_status":"gold","oa_url":"https://inria.hal.science/hal-01515242","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000765311","display_name":"Domagoj Babi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114444","display_name":"Meta (United States)","ror":"https://ror.org/01zbnvs85","country_code":"US","type":"company","lineage":["https://openalex.org/I4210114444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Domagoj Babi\u0107","raw_affiliation_strings":["Facebook, Inc., USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facebook, Inc., USA","institution_ids":["https://openalex.org/I4210114444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021217615","display_name":"Zvonimir Rakamari\u0107","orcid":"https://orcid.org/0000-0001-7946-0162"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zvonimir Rakamari\u0107","raw_affiliation_strings":["University of Utah, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Utah, USA","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":3.3338,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.90776316,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9987999796867371,"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.8616183996200562},{"id":"https://openalex.org/keywords/pushdown-automaton","display_name":"Pushdown automaton","score":0.7808655500411987},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.728054404258728},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.7108186483383179},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5849226713180542},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5630344748497009},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.517125129699707},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5122761130332947},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4824400544166565},{"id":"https://openalex.org/keywords/tuple","display_name":"Tuple","score":0.4716058373451233},{"id":"https://openalex.org/keywords/embedded-pushdown-automaton","display_name":"Embedded pushdown automaton","score":0.46285903453826904},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3050118088722229},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2860989272594452},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.204685240983963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11368650197982788},{"id":"https://openalex.org/keywords/parsing","display_name":"Parsing","score":0.08649808168411255},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.07535430788993835}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8616183996200562},{"id":"https://openalex.org/C77944639","wikidata":"https://www.wikidata.org/wiki/Q751443","display_name":"Pushdown automaton","level":3,"score":0.7808655500411987},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.728054404258728},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.7108186483383179},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5849226713180542},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5630344748497009},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.517125129699707},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5122761130332947},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4824400544166565},{"id":"https://openalex.org/C118930307","wikidata":"https://www.wikidata.org/wiki/Q600590","display_name":"Tuple","level":2,"score":0.4716058373451233},{"id":"https://openalex.org/C27034413","wikidata":"https://www.wikidata.org/wiki/Q5370010","display_name":"Embedded pushdown automaton","level":5,"score":0.46285903453826904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3050118088722229},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2860989272594452},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.204685240983963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11368650197982788},{"id":"https://openalex.org/C186644900","wikidata":"https://www.wikidata.org/wiki/Q194152","display_name":"Parsing","level":2,"score":0.08649808168411255},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.07535430788993835},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/978-3-642-38592-6_16","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-38592-6_16","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.357.3353","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.357.3353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.domagoj-babic.com/uploads/Pubs/Forte13async/forte13async.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.357.3552","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.357.3552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.domagoj-babic.com/uploads/Pubs/Techrep11async/techrep11async.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.406.2752","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.2752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/Pubs/TechRpts/2011/EECS-2011-108.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01515242v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01515242","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2013, Florence, Italy. pp.225-241, ⟨10.1007/978-3-642-38592-6_16⟩","raw_type":"Conference papers"},{"id":"pmh:oai:berkeley.edu:28722-bk001000z1g","is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/EECS-2011-108.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01515242v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01515242","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"15th International Conference on Formal Methods for Open Object-Based Distributed Systems (FMOOODS) / 33th International Conference on Formal Techniques for Networked and Distributed Systems (FORTE), Jun 2013, Florence, Italy. pp.225-241, ⟨10.1007/978-3-642-38592-6_16⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W17260705","https://openalex.org/W1480600454","https://openalex.org/W1493367105","https://openalex.org/W1495774331","https://openalex.org/W1497571013","https://openalex.org/W1497640022","https://openalex.org/W1526347109","https://openalex.org/W1532970407","https://openalex.org/W1536744902","https://openalex.org/W1556566737","https://openalex.org/W1563374799","https://openalex.org/W1578399599","https://openalex.org/W1589421353","https://openalex.org/W1593799327","https://openalex.org/W1614411949","https://openalex.org/W1623927329","https://openalex.org/W1762311305","https://openalex.org/W1842117537","https://openalex.org/W1860772589","https://openalex.org/W1861590051","https://openalex.org/W1969005071","https://openalex.org/W1975745970","https://openalex.org/W1979257155","https://openalex.org/W1982556442","https://openalex.org/W2005868161","https://openalex.org/W2010365467","https://openalex.org/W2025970201","https://openalex.org/W2031575609","https://openalex.org/W2054801208","https://openalex.org/W2060345611","https://openalex.org/W2066725205","https://openalex.org/W2104532741","https://openalex.org/W2110697379","https://openalex.org/W2111270089","https://openalex.org/W2121421673","https://openalex.org/W2123345128","https://openalex.org/W2123948057","https://openalex.org/W2126533781","https://openalex.org/W2144271133","https://openalex.org/W2148620466","https://openalex.org/W2151033407","https://openalex.org/W2159181605","https://openalex.org/W2162284942","https://openalex.org/W2167521024","https://openalex.org/W3009147436","https://openalex.org/W4241223029","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2150468037","https://openalex.org/W2032269072","https://openalex.org/W1991406344","https://openalex.org/W1989788631","https://openalex.org/W2758239419","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W4288581691","https://openalex.org/W1972232894","https://openalex.org/W1999231617"],"abstract_inverted_index":{"We":[0],"introduce":[1],"an":[2],"automata-based":[3],"formal":[4],"model":[5,19,54,73,98],"suitable":[6,122],"for":[7,123,195],"specifying,":[8],"modeling,":[9],"analyzing,":[10],"and":[11,15,45,76,152,157,189],"verifying":[12],"asynchronous":[13,70],"task-based":[14,43,67],"message-passing":[16,51],"programs.":[17,52],"Our":[18,53,97],"consists":[20],"of":[21,38,50,69,78,92,131,135,148,155,164,173,180],"visibly":[22,116,142],"pushdown":[23,117,143],"automata":[24],"communicating":[25,103],"over":[26],"unbounded":[27],"reliable":[28],"point-to-point":[29],"first-in-first-out":[30],"queues.":[31],"Such":[32],"a":[33,141],"combination":[34],"unifies":[35],"two":[36],"branches":[37],"research,":[39],"one":[40],"focused":[41],"on":[42,48,89,137],"models,":[44],"the":[46,90,101,129,159,186],"other":[47],"models":[49,58,68],"generalizes":[55,100],"previously":[56],"proposed":[57],"that":[59,185],"have":[60],"decidable":[61,194],"reachability":[62,191],"in":[63],"several":[64],"ways.":[65],"Unlike":[66],"programs,":[71,127],"our":[72,196],"allows":[74],"sending":[75],"receiving":[77],"messages":[79,136],"even":[80],"when":[81],"stacks":[82],"are":[83,120,192],"not":[84],"empty,":[85],"without":[86],"imposing":[87],"restrictions":[88],"number":[91],"context-switches":[93],"or":[94],"communication":[95],"topology.":[96],"also":[99],"well-known":[102],"finite-state":[104],"machines":[105],"with":[106],"recognizable":[107],"channel":[108],"property":[109],"allowing":[110],"(1)":[111],"individual":[112],"components":[113],"to":[114,139,167],"be":[115,168],"automata,":[118],"which":[119,145,170],"more":[121],"modeling":[124,147,172],"(possibly":[125],"recursive)":[126],"(2)":[128],"set":[130],"words":[132],"(i.e.,":[133],"languages)":[134],"queues":[138],"form":[140],"language,":[144],"permits":[146,171],"remote":[149],"procedure":[150],"calls":[151],"simple":[153],"forms":[154],"counting,":[156],"(3)":[158],"relations":[160],"formed":[161],"by":[162],"tuples":[163],"such":[165],"languages":[166],"synchronized,":[169],"complex":[174],"interactions":[175],"among":[176],"processes.":[177],"In":[178],"spite":[179],"these":[181],"generalizations,":[182],"we":[183],"prove":[184],"composite":[187],"configuration":[188],"control-state":[190],"still":[193],"model.":[197]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}