uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Extended pi-Calculi
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)ORCID iD: 0000-0003-0174-9032
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Mobility)
Responsible organisation
2008 (English)In: Automata, Languages and Programming, PT 2: Proceedings of ICALP 2008 / [ed] Aceto L, Damgard I, Goldberg LA, Halldorsson MM, Ingolfsdottir A, Walukiewicz I, 2008, 87-98 p.Conference paper, Published paper (Refereed)
Abstract [en]

We demonstrate a general framework for extending the pi-calculus with data terms. In this we generalise and improve on several related efforts such as the spi-calculus and the applied pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definition of bisimilarity. We provide general criteria on the semantic equivalence of data terms; with these we prove algebraic laws and that bisimulation is preserved by the operators in the usual way. The definitions are simple enough that an implementation in an automated proof assistant is feasible.

Place, publisher, year, edition, pages
2008. 87-98 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5126
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-16592DOI: 10.1007/978-3-540-70583-3_8ISI: 000257663100008ISBN: 978-3-540-70582-6 (print)OAI: oai:DiVA.org:uu-16592DiVA: diva2:44363
Conference
35th International Colloquium on Automata, Languages and Programming Keykjavik, ICELAND, JUL 07-11, 2008
Available from: 2008-12-03 Created: 2008-12-03 Last updated: 2016-02-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Johansson, MagnusParrow, JoachimVictor, BjörnBengtson, Jesper

Search in DiVA

By author/editor
Johansson, MagnusParrow, JoachimVictor, BjörnBengtson, Jesper
By organisation
Computing ScienceComputer Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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