2026-07-30T19:22:00Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5998 2024-03-06T10:37:26Z ddc:004 open_access

Weighted Relational Models for Mobility Laird, James Concurrency Mobility Denotational Semantics 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 lambda-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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik James Laird 2016 Is Part Of LIPIcs, Volume 52, 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSCD.2016.24 urn:nbn:de:0030-drops-59982 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.24 eng https://creativecommons.org/licenses/by/3.0/legalcode