A Sorted Semantic Framework for Applied Process Calculi

Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are ex...

Full description

Saved in:
Bibliographic Details
Published in:Logical methods in computer science Vol. 12, Issue 1; no. 1; p. 1
Main Authors: Borgström, Johannes, Gutkovas, Ramūnas, Parrow, Joachim, Victor, Björn, Pohjola, Johannes Åman
Format: Journal Article
Language:English
Published: Logical Methods in Computer Science e.V 31.03.2016
Subjects:
Computer Science
computer science - logic in computer science
Datavetenskap
Expressiveness
Nominal sets
Pattern matching
pi-calculus
Theorem proving
Type systems
ISSN:1860-5974, 1860-5974
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Applied process calculi include advanced programming constructs such as type systems, communication with pattern matching, encryption primitives, concurrent constraints, nondeterminism, process creation, and dynamic connection topologies. Several such formalisms, e.g. the applied pi calculus, are extensions of the the pi-calculus; a growing number is geared towards particular applications or computational paradigms. Our goal is a unified framework to represent different process calculi and notions of computation. To this end, we extend our previous work on psi-calculi with novel abstract patterns and pattern matching, and add sorts to the data term language, giving sufficient criteria for subject reduction to hold. Our framework can directly represent several existing process calculi; the resulting transition systems are isomorphic to the originals up to strong bisimulation. We also demonstrate different notions of computation on data terms, including cryptographic primitives and a lambda-calculus with erratic choice. Finally, we prove standard congruence and structural properties of bisimulation; the proof has been machine-checked using Nominal Isabelle in the case of a single name sort.
ISSN:1860-5974
1860-5974
DOI:10.2168/LMCS-12(1:8)2016