Università degli Studi dell'Insubria Insubria Space
 

InsubriaSPACE - Thesis PhD Repository >
Insubria Thesis Repository >
01 - Tesi di dottorato >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10277/314

Authors: De Francesco Albasini, Luisa Flavia Maria Giovanna
Internal Tutor: WALTERS, ROBERT F.C.
SABADINI, NICOLETTA
Title: Categorical algebras for the compositional construction of probabilistic and distributed systems.
Abstract: Structured transition systems have been widely used in the formal specification of computing systems, including concurrent and probabilistic systems. In this thesis we extend the span of graphs algebra introduced in [40] to describe concurrent systems in a compositional way, in order to model probabilistic distributed systems. The span algebra of [40] may be regarded as an extension of various automata models of computation based on distributed automata. With the introduction of both parallel and sequential operations, this extension allows the compositional description of concurrent, distributed and mobile systems. An important aspect of span graph model is that there is also a geometric characterization associated with the algebra along the lines of Penrose’s algebra of tensors. The algebra of transition systems we describe is a well-supported compact closed category - a symmetric monoidal category for which every object has a separable algebra structure (satisfying Frobenius equation) - whose arrows are automata in which the actions have probabilities. The operations of the category permit the compositional description of probabilistic processes and in particular of classical finite Markov chains. The systems we can model with our algebra are distributed, hierarchical and with an evolving geometry. We also extend the span algebra of [40] in order to permit the inclusion of quantum components. Again, this algebra is a well-supported compact closed category. This extension permits a compositional description of quantum protocols, in which quantum components interact with classical finite state components. In our view, the inclusion of explicit components of finite state classical control adds conceptual clarity and precision to quantum protocols.
Keywords: Classical automaton, weighted automaton, monoidal category, span, probabilistic automaton, Markov chain, compositionality, quantum automaton, compact closed, Frobenius equations, teleportation
Subject MIUR : INF/01 INFORMATICA
Issue Date: 2011
Language: en
Doctoral course: Matematica del Calcolo: Modelli, Strutture, Algoritmi e Applicazioni
Academic cycle: 23
Publisher: Università degli Studi dell'Insubria
Citation: De Francesco Albasini, L.F.M.G.Categorical algebras for the compositional construction of probabilistic and distributed systems. (Doctoral Thesis, Università degli Studi dell'Insubria, 2011).

Files in This Item:

File Description SizeFormatVisibility
Phd_thesis_defrancescoalbasini.pdftesto completo tesi984,56 kBAdobe PDFView/Open


Items in InsubriaSPACE are protected by copyright, with all rights reserved, unless otherwise indicated.


Share this record
Del.icio.us

Citeulike

Connotea

Facebook

Stumble it!

reddit


 

  ICT Support, development & maintenance are provided by the AePIC team @ CILEA. Powered on DSpace Software.  Feedback