Weighted relational models for mobility

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding


We investigate operational and denotational semantics for computational and concurrent systems with mobile names which capture their computational properties. For example, various properties of fixed networks, such as shortest or longest path, transition probabilities, and secure data flows, correspond to the "sum" in a semiring of the weights of paths through the network: we aim to model networks with a dynamic topology in a similar way. Alongside rich computational formalisms such as the λ-calculus, these can be represented as terms in a calculus of solos with weights from a complete semiring R, so that reduction associates a weight in R to each reduction path. Taking inspiration from differential nets, we develop a denotational semantics for this calculus in the category of sets and R-weighted relations, based on its differential and compact-closed structure, but giving a simple, syntax-independent representation of terms as matrices over R. We show that this corresponds to the sum in R of the values associated to its independent reduction paths, and that our semantics is fully abstract with respect to the observational equivalence induced by sum-of-paths evaluation.

Original languageEnglish
Title of host publicationLeibniz International Proceedings in Informatics, LIPIcs
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Number of pages15
ISBN (Print)9783959770101
Publication statusPublished - 1 Jun 2016
Event1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016 - Porto, Portugal
Duration: 22 Jun 201626 Jun 2016


Conference1st International Conference on Formal Structures for Computation and Deduction, FSCD 2016


  • Concurrency
  • Mobility
  • Solos

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Weighted relational models for mobility'. Together they form a unique fingerprint.

Cite this