Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the bounded response property : in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler’s proce...
Gespeichert in:
| Veröffentlicht in: | Theory of computing systems 2014-07, Vol.55 (1), p.136-169 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 169 |
|---|---|
| container_issue | 1 |
| container_start_page | 136 |
| container_title | Theory of computing systems |
| container_volume | 55 |
| creator | Czerwiński, Wojciech Hofman, Piotr Lasota, Sławomir |
| description | We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the
bounded response property
: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler’s process. The linear bound is effective, which leads to decidability of branching bisimilarity. For weak bisimilarity, we are able merely to show existence of some linear bound, which is not sufficient for decidability. We conjecture however that the same effective bound holds for weak bisimilarity as well. We suppose that further elaboration of novel techniques developed in this paper may be sufficient to demonstrate decidability. |
| doi_str_mv | 10.1007/s00224-013-9505-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1551062627</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1551062627</sourcerecordid><originalsourceid>FETCH-LOGICAL-c392t-8f0cbc25eb850af23bbf7d316c795b5f4aaa383defde4528ab4be82b72b271f3</originalsourceid><addsrcrecordid>eNp1kE9LxDAQxYsouP75AN4KXrxEJ0mzbY_u6qqwqODeQ5JONNI2a9KKfnuzrgcRhIF5DL_3GF6WnVA4pwDlRQRgrCBAOakFCFLvZBNacE6gqGH3WzNScAH72UGMrwDAK4BJ9nSFxjVKu9YNn7m3-Syo3ry4_jmfuei6sVWD832e5t6HDpt87rtuHNL1HZPuB_wYyCIg5o_BG4wR41G2Z1Ub8fhnH2arxfVqfkuWDzd388slMbxmA6ksGG2YQF0JUJZxrW3ZcDo1ZS20sIVSile8QdtgIVildKGxYrpkmpXU8sPsbBu7Dv5txDjIzkWDbat69GOUVAgKUzZlZUJP_6Cvfgx9ei5RHARPbJUouqVM8DEGtHIdXKfCp6QgNy3LbcsytSw3Lcs6edjWExPbP2P4lfyv6Qut7H_6</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1530531558</pqid></control><display><type>article</type><title>Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Czerwiński, Wojciech ; Hofman, Piotr ; Lasota, Sławomir</creator><creatorcontrib>Czerwiński, Wojciech ; Hofman, Piotr ; Lasota, Sławomir</creatorcontrib><description>We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the
bounded response property
: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler’s process. The linear bound is effective, which leads to decidability of branching bisimilarity. For weak bisimilarity, we are able merely to show existence of some linear bound, which is not sufficient for decidability. We conjecture however that the same effective bound holds for weak bisimilarity as well. We suppose that further elaboration of novel techniques developed in this paper may be sufficient to demonstrate decidability.</description><identifier>ISSN: 1432-4350</identifier><identifier>EISSN: 1433-0490</identifier><identifier>DOI: 10.1007/s00224-013-9505-9</identifier><identifier>CODEN: TCSYFI</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Analysis ; Computation ; Computer Science ; Games ; Graph theory ; Graphs ; Investigations ; Parallel processing ; Reproduction ; Studies ; Theory of Computation ; Transition rules ; Variables</subject><ispartof>Theory of computing systems, 2014-07, Vol.55 (1), p.136-169</ispartof><rights>The Author(s) 2013</rights><rights>Springer Science+Business Media New York 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c392t-8f0cbc25eb850af23bbf7d316c795b5f4aaa383defde4528ab4be82b72b271f3</citedby><cites>FETCH-LOGICAL-c392t-8f0cbc25eb850af23bbf7d316c795b5f4aaa383defde4528ab4be82b72b271f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00224-013-9505-9$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00224-013-9505-9$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Czerwiński, Wojciech</creatorcontrib><creatorcontrib>Hofman, Piotr</creatorcontrib><creatorcontrib>Lasota, Sławomir</creatorcontrib><title>Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes</title><title>Theory of computing systems</title><addtitle>Theory Comput Syst</addtitle><description>We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the
bounded response property
: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler’s process. The linear bound is effective, which leads to decidability of branching bisimilarity. For weak bisimilarity, we are able merely to show existence of some linear bound, which is not sufficient for decidability. We conjecture however that the same effective bound holds for weak bisimilarity as well. We suppose that further elaboration of novel techniques developed in this paper may be sufficient to demonstrate decidability.</description><subject>Analysis</subject><subject>Computation</subject><subject>Computer Science</subject><subject>Games</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Investigations</subject><subject>Parallel processing</subject><subject>Reproduction</subject><subject>Studies</subject><subject>Theory of Computation</subject><subject>Transition rules</subject><subject>Variables</subject><issn>1432-4350</issn><issn>1433-0490</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE9LxDAQxYsouP75AN4KXrxEJ0mzbY_u6qqwqODeQ5JONNI2a9KKfnuzrgcRhIF5DL_3GF6WnVA4pwDlRQRgrCBAOakFCFLvZBNacE6gqGH3WzNScAH72UGMrwDAK4BJ9nSFxjVKu9YNn7m3-Syo3ry4_jmfuei6sVWD832e5t6HDpt87rtuHNL1HZPuB_wYyCIg5o_BG4wR41G2Z1Ub8fhnH2arxfVqfkuWDzd388slMbxmA6ksGG2YQF0JUJZxrW3ZcDo1ZS20sIVSile8QdtgIVildKGxYrpkmpXU8sPsbBu7Dv5txDjIzkWDbat69GOUVAgKUzZlZUJP_6Cvfgx9ei5RHARPbJUouqVM8DEGtHIdXKfCp6QgNy3LbcsytSw3Lcs6edjWExPbP2P4lfyv6Qut7H_6</recordid><startdate>20140701</startdate><enddate>20140701</enddate><creator>Czerwiński, Wojciech</creator><creator>Hofman, Piotr</creator><creator>Lasota, Sławomir</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope></search><sort><creationdate>20140701</creationdate><title>Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes</title><author>Czerwiński, Wojciech ; Hofman, Piotr ; Lasota, Sławomir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c392t-8f0cbc25eb850af23bbf7d316c795b5f4aaa383defde4528ab4be82b72b271f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Analysis</topic><topic>Computation</topic><topic>Computer Science</topic><topic>Games</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Investigations</topic><topic>Parallel processing</topic><topic>Reproduction</topic><topic>Studies</topic><topic>Theory of Computation</topic><topic>Transition rules</topic><topic>Variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Czerwiński, Wojciech</creatorcontrib><creatorcontrib>Hofman, Piotr</creatorcontrib><creatorcontrib>Lasota, Sławomir</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><jtitle>Theory of computing systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Czerwiński, Wojciech</au><au>Hofman, Piotr</au><au>Lasota, Sławomir</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes</atitle><jtitle>Theory of computing systems</jtitle><stitle>Theory Comput Syst</stitle><date>2014-07-01</date><risdate>2014</risdate><volume>55</volume><issue>1</issue><spage>136</spage><epage>169</epage><pages>136-169</pages><issn>1432-4350</issn><eissn>1433-0490</eissn><coden>TCSYFI</coden><abstract>We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the
bounded response property
: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler’s process. The linear bound is effective, which leads to decidability of branching bisimilarity. For weak bisimilarity, we are able merely to show existence of some linear bound, which is not sufficient for decidability. We conjecture however that the same effective bound holds for weak bisimilarity as well. We suppose that further elaboration of novel techniques developed in this paper may be sufficient to demonstrate decidability.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s00224-013-9505-9</doi><tpages>34</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1432-4350 |
| ispartof | Theory of computing systems, 2014-07, Vol.55 (1), p.136-169 |
| issn | 1432-4350 1433-0490 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1551062627 |
| source | Business Source Complete; SpringerLink Journals - AutoHoldings |
| subjects | Analysis Computation Computer Science Games Graph theory Graphs Investigations Parallel processing Reproduction Studies Theory of Computation Transition rules Variables |
| title | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T12%3A39%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Decidability%20of%20Branching%20Bisimulation%20on%20Normed%20Commutative%20Context-Free%20Processes&rft.jtitle=Theory%20of%20computing%20systems&rft.au=Czerwi%C5%84ski,%20Wojciech&rft.date=2014-07-01&rft.volume=55&rft.issue=1&rft.spage=136&rft.epage=169&rft.pages=136-169&rft.issn=1432-4350&rft.eissn=1433-0490&rft.coden=TCSYFI&rft_id=info:doi/10.1007/s00224-013-9505-9&rft_dat=%3Cproquest_cross%3E1551062627%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1530531558&rft_id=info:pmid/&rfr_iscdi=true |