Talk "Component models in typed linear algebra"

by Luis S. Barbosa

Sat, 16 March 2013 at 04:00 pm in Rome, Italy

Joint work with: José Nuno Oliveira

Abstract: In the specification of component-based systems, relations nicely capture nondeterminism and vagueness of requirements. Probabilistic functions go a step further by quantifying the likelihood of each possible, expected or faulty, behaviour. Such a shift from qualitative to quantitative reasoning, which is becoming pervasive in Computer Science, calls for a language able to accommodate both these aspects, while preserving the polymorphic and calculational style of relational program derivation. Recently, typed linear algebra has been suggested as a suitable candidate for such a unifying rôle, when restricting to discrete probability spaces. In this talk, this framework is put at work to discuss weighted automata, and related models for software components, as coalgebras in categories of dimensions and matrices.