Computing strong and weak bisimulations for psi-calculi
We present a symbolic transition system and strong and weak bisimulation equivalences for psi-calculi, and show that they are fully abstract with respect to bisimulation congruences in the non-symbolic semantics. A procedure which computes the most general constraint under which two agents are bisim...
Saved in:
| Published in: | The journal of logic and algebraic programming Vol. 81; no. 3; pp. 162 - 180 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.04.2012
|
| Subjects: | |
| ISSN: | 1567-8326, 1873-5940 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We present a symbolic transition system and strong and weak bisimulation equivalences for psi-calculi, and show that they are fully abstract with respect to bisimulation congruences in the non-symbolic semantics. A procedure which computes the most general constraint under which two agents are bisimilar is developed and proved correct.
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Psi-calculi can be more general than other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, or the concurrent constraint pi-calculus.
Symbolic semantics are necessary for an efficient implementation of the calculus in automated tools exploring state spaces, and the full abstraction property means the symbolic semantics makes exactly the same distinctions as the original. |
|---|---|
| AbstractList | We present a symbolic transition system and strong and weak bisimulation equivalences for psi-calculi, and show that they are fully abstract with respect to bisimulation congruences in the non-symbolic semantics. A procedure which computes the most general constraint under which two agents are bisimilar is developed and proved correct.
A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations. Psi-calculi can be more general than other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, or the concurrent constraint pi-calculus.
Symbolic semantics are necessary for an efficient implementation of the calculus in automated tools exploring state spaces, and the full abstraction property means the symbolic semantics makes exactly the same distinctions as the original. |
| Author | Victor, Björn Parrow, Joachim Johansson, Magnus |
| Author_xml | – sequence: 1 givenname: Magnus surname: Johansson fullname: Johansson, Magnus – sequence: 2 givenname: Björn surname: Victor fullname: Victor, Björn – sequence: 3 givenname: Joachim surname: Parrow fullname: Parrow, Joachim |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-162421$$DView record from Swedish Publication Index (Uppsala universitet) |
| BookMark | eNp9kMtOwzAQRb0oEi3wA6zyASR4nNhxl1V5SpXYANvRxHUqhzSO7EQVf09KYcOC1ZVG98xozoLNOt9Zxq6BZ8BB3TZZ01KfCQ4i45BxDjM2B6nKVOdCnbNFjM00LLlWc1au_b4fB9ftkjgEPwV12-Rg6SOpXHT7saXB-S4mtQ9JH11qqDVj6y7ZWU1ttFc_ecHeHu5f10_p5uXxeb3apEboYkgrVVot82KrtIWlBCLSUpeShAWoa2lqk1eizG1R8aVWGuRWlKRssZQCoKD8gt2c9saD7ccK--D2FD7Rk8M7975CH3Y4jghKFAKmuj7VTfAxBlujccP3B0Mg1yJwPDrCBo-O8OgIOeCkY0LFH_T31j_QFzBCb-Q |
| CitedBy_id | crossref_primary_10_1007_s10270_013_0375_z crossref_primary_10_1016_j_tcs_2023_113842 crossref_primary_10_1145_2682570 |
| Cites_doi | 10.1016/j.jlap.2007.06.002 10.4204/EPTCS.18.2 10.3233/JCS-2010-0363 10.1109/CSFW.2001.930138 10.1007/978-1-4419-8849-2_58 10.1007/s001650200016 10.1016/0304-3975(94)00172-F 10.1007/BF02951922 10.1145/360204.360213 10.1109/LICS.2010.30 10.1145/1044731.1044735 10.1016/S0890-5401(03)00138-X 10.1007/s002360050036 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION ADTPV AOWAS DF2 |
| DOI | 10.1016/j.jlap.2012.01.001 |
| DatabaseName | CrossRef SwePub SwePub Articles SWEPUB Uppsala universitet |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 180 |
| ExternalDocumentID | oai_DiVA_org_uu_162421 10_1016_j_jlap_2012_01_001 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29K 4.4 4G. 5GY 5VS 7-5 71M 8P~ 9DU AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQXK AATTM AAXKI AAXUO AAYFN AAYWO AAYXX ABBOA ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNCT ACNNM ACRLP ACRPL ACVFH ACZNC ADBBV ADCNI ADEZE ADMUD ADNMO ADVLN AEBSH AEIPS AEKER AETEA AEUPX AEXQZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHZHX AIEXJ AIGII AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CITATION CS3 D-I D0L DU5 EBS EFJIC EFKBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBOLZ HVGLF HZ~ IHE IXB J1W KOM M41 MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SDF SDG SDP SES SEW SPC SSV SSZ T5K TN5 UHS ~HD ADTPV AOWAS DF2 |
| ID | FETCH-LOGICAL-c284t-b67e8534d68e1951aaa85875a2e11ff5cfc3b273e4b0986815d27a6e4952114a3 |
| ISICitedReferencesCount | 8 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000302500700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1567-8326 1873-5940 |
| IngestDate | Tue Nov 04 17:00:09 EST 2025 Tue Nov 18 21:26:23 EST 2025 Sat Nov 29 07:00:02 EST 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Issue | 3 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c284t-b67e8534d68e1951aaa85875a2e11ff5cfc3b273e4b0986815d27a6e4952114a3 |
| PageCount | 19 |
| ParticipantIDs | swepub_primary_oai_DiVA_org_uu_162421 crossref_citationtrail_10_1016_j_jlap_2012_01_001 crossref_primary_10_1016_j_jlap_2012_01_001 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-04-01 |
| PublicationDateYYYYMMDD | 2012-04-01 |
| PublicationDate_xml | – month: 04 year: 2012 text: 2012-04-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | The journal of logic and algebraic programming |
| PublicationYear | 2012 |
| References | Delaune (10.1016/j.jlap.2012.01.001_b0085) 2010; 18 Lin (10.1016/j.jlap.2012.01.001_b0135) 2000; 15 Gabbay (10.1016/j.jlap.2012.01.001_b0090) 2001; 13 Pitts (10.1016/j.jlap.2012.01.001_b0155) 2003; 186 Liu (10.1016/j.jlap.2012.01.001_b0145) 2010 Liu (10.1016/j.jlap.2012.01.001_b0150) 2010 Lin (10.1016/j.jlap.2012.01.001_b0130) 1996 10.1016/j.jlap.2012.01.001_b0010 10.1016/j.jlap.2012.01.001_b0055 10.1016/j.jlap.2012.01.001_b0110 Hennessy (10.1016/j.jlap.2012.01.001_b0105) 1995; 138 Abadi (10.1016/j.jlap.2012.01.001_b0005) 2005; 52 Bengtson (10.1016/j.jlap.2012.01.001_b0035) 2011; 7 10.1016/j.jlap.2012.01.001_b0115 Borgström (10.1016/j.jlap.2012.01.001_b0060) 2002 10.1016/j.jlap.2012.01.001_b0070 10.1016/j.jlap.2012.01.001_b0095 Borgström (10.1016/j.jlap.2012.01.001_b0065) 2004 Victor (10.1016/j.jlap.2012.01.001_b0165) 1994 Boreale (10.1016/j.jlap.2012.01.001_b0050) 1996; 126 Buscemi (10.1016/j.jlap.2012.01.001_b0075) 2008 Bengtson (10.1016/j.jlap.2012.01.001_b0030) 2009 Blanchet (10.1016/j.jlap.2012.01.001_b0045) 2008; 75 10.1016/j.jlap.2012.01.001_b0120 Abadi (10.1016/j.jlap.2012.01.001_b0015) 1999; 148 Bengtson (10.1016/j.jlap.2012.01.001_b0025) 2009 Delaune (10.1016/j.jlap.2012.01.001_b0080) 2007 10.1016/j.jlap.2012.01.001_b0125 Sangiorgi (10.1016/j.jlap.2012.01.001_b0160) 1996; 33 10.1016/j.jlap.2012.01.001_b0040 Hennessy (10.1016/j.jlap.2012.01.001_b0100) 1993 10.1016/j.jlap.2012.01.001_b0140 10.1016/j.jlap.2012.01.001_b0020 |
| References_xml | – volume: 75 start-page: 3 issue: 1 year: 2008 ident: 10.1016/j.jlap.2012.01.001_b0045 article-title: Automated verification of selected equivalences for security protocols publication-title: J. Logic Algebraic Program. doi: 10.1016/j.jlap.2007.06.002 – start-page: 287 year: 2002 ident: 10.1016/j.jlap.2012.01.001_b0060 article-title: On bisimulations for the spi calculus – start-page: 161 year: 2004 ident: 10.1016/j.jlap.2012.01.001_b0065 article-title: Symbolic bisimulation in the spi calculus – ident: 10.1016/j.jlap.2012.01.001_b0115 doi: 10.4204/EPTCS.18.2 – start-page: 254 year: 2008 ident: 10.1016/j.jlap.2012.01.001_b0075 article-title: Open bisimulation for the concurrent constraint pi-calculus – volume: 18 start-page: 317 issue: 2 year: 2010 ident: 10.1016/j.jlap.2012.01.001_b0085 article-title: Symbolic bisimulation for the applied pi calculus publication-title: J. Comput. Security doi: 10.3233/JCS-2010-0363 – ident: 10.1016/j.jlap.2012.01.001_b0040 doi: 10.1109/CSFW.2001.930138 – ident: 10.1016/j.jlap.2012.01.001_b0140 doi: 10.1007/978-1-4419-8849-2_58 – volume: 148 start-page: 1 issue: 1 year: 1999 ident: 10.1016/j.jlap.2012.01.001_b0015 article-title: A calculus for cryptographic protocols: the spi calculus publication-title: J. Inform. Comput. – volume: 7 start-page: 1 issue: 1:11 year: 2011 ident: 10.1016/j.jlap.2012.01.001_b0035 article-title: Psi-calculi: a framework for mobile processes with nominal data and logic publication-title: Logical Methods Comput. Sci. – ident: 10.1016/j.jlap.2012.01.001_b0055 – volume: 13 start-page: 341 year: 2001 ident: 10.1016/j.jlap.2012.01.001_b0090 article-title: A new approach to abstract syntax with variable binding publication-title: Formal Aspects Comput. doi: 10.1007/s001650200016 – start-page: 39 year: 2009 ident: 10.1016/j.jlap.2012.01.001_b0030 article-title: Psi-calculi: mobile processes, nominal data, and logic – volume: 138 start-page: 353 issue: 2 year: 1995 ident: 10.1016/j.jlap.2012.01.001_b0105 article-title: Symbolic bisimulations publication-title: Theoret. Comput. Sci. doi: 10.1016/0304-3975(94)00172-F – start-page: 229 year: 2010 ident: 10.1016/j.jlap.2012.01.001_b0150 article-title: Proof system for applied pi calculus – volume: 15 start-page: 1 issue: 1 year: 2000 ident: 10.1016/j.jlap.2012.01.001_b0135 article-title: Computing bisimulations for finite-control pi-calculus publication-title: J. Comput. Sci. Technol. doi: 10.1007/BF02951922 – ident: 10.1016/j.jlap.2012.01.001_b0070 – start-page: 552 year: 2010 ident: 10.1016/j.jlap.2012.01.001_b0145 article-title: A complete symbolic bisimulation for full applied pi calculus – ident: 10.1016/j.jlap.2012.01.001_b0010 doi: 10.1145/360204.360213 – ident: 10.1016/j.jlap.2012.01.001_b0095 – ident: 10.1016/j.jlap.2012.01.001_b0020 – start-page: 202 year: 1993 ident: 10.1016/j.jlap.2012.01.001_b0100 article-title: Proof systems for message-passing process algebras – volume: 126 start-page: 34 issue: 1 year: 1996 ident: 10.1016/j.jlap.2012.01.001_b0050 article-title: A symbolic semantics for the π-calculus publication-title: J. Inform. Comput. – start-page: 428 year: 1994 ident: 10.1016/j.jlap.2012.01.001_b0165 article-title: The Mobility Workbench – a tool for the π-calculus – ident: 10.1016/j.jlap.2012.01.001_b0110 – ident: 10.1016/j.jlap.2012.01.001_b0120 doi: 10.1109/LICS.2010.30 – volume: 52 start-page: 102 issue: 1 year: 2005 ident: 10.1016/j.jlap.2012.01.001_b0005 article-title: Analyzing security protocols with secrecy types and logic programs publication-title: J. ACM doi: 10.1145/1044731.1044735 – volume: 186 start-page: 165 year: 2003 ident: 10.1016/j.jlap.2012.01.001_b0155 article-title: Nominal logic, a first order theory of names and binding publication-title: Inform. Comput. doi: 10.1016/S0890-5401(03)00138-X – start-page: 99 year: 2009 ident: 10.1016/j.jlap.2012.01.001_b0025 article-title: Psi-calculi in Isabelle – start-page: 133 year: 2007 ident: 10.1016/j.jlap.2012.01.001_b0080 article-title: Symbolic bisimulation for the applied pi calculus – start-page: 50 year: 1996 ident: 10.1016/j.jlap.2012.01.001_b0130 article-title: Symbolic transition graph with assignment – volume: 33 start-page: 69 year: 1996 ident: 10.1016/j.jlap.2012.01.001_b0160 article-title: A theory of bisimulation for the π-calculus publication-title: Acta Informatica doi: 10.1007/s002360050036 – ident: 10.1016/j.jlap.2012.01.001_b0125 |
| SSID | ssj0017086 |
| Score | 1.5882776 |
| Snippet | We present a symbolic transition system and strong and weak bisimulation equivalences for psi-calculi, and show that they are fully abstract with respect to... |
| SourceID | swepub crossref |
| SourceType | Open Access Repository Enrichment Source Index Database |
| StartPage | 162 |
| SubjectTerms | Bisimulation Computer Science Datavetenskap Full abstraction Psi-calculi Symbolic semantics TECHNOLOGY TEKNIKVETENSKAP |
| Title | Computing strong and weak bisimulations for psi-calculi |
| URI | https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-162421 |
| Volume | 81 |
| WOSCitedRecordID | wos000302500700002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 1567-8326 databaseCode: AIEXJ dateStart: 20010101 customDbUrl: isFulltext: true dateEnd: 20140131 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0017086 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3PT9swFLa2wmGXwWDTgIF82E4oU50msXMsDMTQhjgw1FvkOk6V0qZV2gB_Pu_FjklBQ-OwS9RGqZX6ffre8_tJyFeVRqkOeOhpzWMv0D3txbIbe8JXMhVpALCq-8z-4hcXYjCIL61XaVGPE-BFIe7v4_l_FTXcA2Fj6ewrxO0WhRvwGYQOVxA7XP9J8GZOg3ETlDNbgnin5c3hMF_k06pJfsP8wvki90BIqprkbSsVsdNqKVHTo-nqOhlhoBm-2byuaaP5TBIO6D1bwfVbjorK2evXuYkNAJbGGJo_ikoHykvXBvIci7vyadsRgRkdLn_FcidwLhBE1CZXwVog6rWYklkSNkqXmXFOz_jcuBbG38cTic1F0XHLMHj0qL2aiP0TpeZSDZsstnGCayS4RtJlmMr3lqz5PIxFh6z1f54Mzl3wiXfrAaHu_9haK5MW-PRNVuyZlW6ztYVytUne26MF7RtIfCBvdLFFNpqxHdSy-DbhDiHUIISCaCkihK4ghAJCaAshH8mf05Or4zPPzs_wFBgdS28YcQ3WWJBGQjOwpKWUIoTzqfQ1Y1kWqkz1hmC-6mDYjUUkWJj6XEYazsw-HJNl7xPpFLNCfyY0VVz5gZBSRzJQGQ4tQGbP_NQXisXBDmHNLiTKNpfHGSeT5O_7v0MO3W_mprXKi09_M5vrnsXG6D_y634yK0dJVSUMS53Y7qtW3SPvHqH8hXSWZaX3ybq6XeaL8sAC4wHVA4Do |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Computing+strong+and+weak+bisimulations+for+psi-calculi&rft.jtitle=The+journal+of+logic+and+algebraic+programming&rft.au=Johansson%2C+Magnus&rft.au=Victor%2C+Bj%C3%B6rn&rft.au=Parrow%2C+Joachim&rft.date=2012-04-01&rft.issn=1567-8326&rft.volume=81&rft.issue=3&rft.spage=162&rft.epage=180&rft_id=info:doi/10.1016%2Fj.jlap.2012.01.001&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_jlap_2012_01_001 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1567-8326&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1567-8326&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1567-8326&client=summon |