Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Complete Symbolic Bisimilarity for an Extended Spi Calculus
Department of Software Engineering and Theoretical Computer Science, Technische Universität Berlin, Germany.
2009 (English)In: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 242, no 3, 3-20 p.Article in journal (Refereed) Published
Abstract [en]

Several symbolic notions of bisimilarity have been defined for the spi calculus and the applied pi calculus. In this paper, we treat a spi calculus with a general constructor-destructor message algebra, and define a symbolic bisimilarity that is both sound and complete with respect to its concrete counterpart. 

Place, publisher, year, edition, pages
Amsterdam, The Netherlands: Elsevier, 2009. Vol. 242, no 3, 3-20 p.
Keyword [en]
Cryptographic Protocols; Formal Verification; Bisimulation; Symbolic Techniques
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:uu:diva-161494DOI: 10.1016/j.entcs.2009.07.078OAI: oai:DiVA.org:uu-161494DiVA: diva2:456317
Conference
SecCo 2008 6th International Workshop on Security Issues in Concurrency, August 23, 2008, Toronto, Canada
Note
Conference paper presented at the SecCo 2008, 6th International Workshop on Security Issues in Concurrency, August 23, 2008, Toronto, CanadaAvailable from: 2011-12-06 Created: 2011-11-14 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

fulltext(472 kB)66 downloads
File information
File name FULLTEXT02.pdfFile size 472 kBChecksum SHA-512
81da35050839903da1b1b58861d2db1a904c4a1649d0f7cf4302bfc9730cbb091e925efd76aabbd0bd7e3f8d45806e57f2dc37354372311288fc9cf93828ec12
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Borgström, Johannes
In the same journal
Electronical Notes in Theoretical Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 66 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 441 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf