In this talk we present Connector Animation---a framework which combines Connector Colouring semantics and the visual syntax of Reo connectors to define Animation Description. The Animation Description is a formal abstract representation for both the structure and the behaviour of Reo connectors suitable to be animated using standard animation tools …
read moreConnector Colouring Revisited: Preliminary Results
Connector colouring was devised as a way of determinining which "macro-step" of a connector to perform next, abstracting away from details such as "which state to go into". Connector colouring has served as a suitable basis for implementing connectors, but it still remains somewhat mysterious and problematic. This talk recasts …
read moreModelling and Refinement of Component-based Software Systems: A Coalgebraic Perspective
Although increasingly popular, software component techniques still lack suitable formal foundations on top of which rigorous methodologies for the description and analysis of component-based systems could be built. This talk is about my thesis work and aims to contribute in this direction: building on the previous work "components as coalgebras …
read moreAnalysing the MUTE Anonymous File-Sharing System Using the Pi-calculus
We give details of a formal analysis of the MUTE system for anonymous file-sharing. We build pi-calculus models of a node that is innocent of sharing files, a node that is guilty of file-sharing and of the network environment. We then test to see if an attacker can distinguish between …
read moreDistributed Coordination via a Russion Dolls Model of Distributed Object Reflection
A family of models of coordination of distributed object systems representing different views, with refinement relations between the different views will be described. We start with distributed objects interacting via asynchronous message passing. The semantics of such a system is a set of event partial orders (event diagrams) giving the …
read moreQ Automata: Modelling the Resource Usage of Concurrent Components
This is mainly a practice talk for a presentation I will give at the FOCLASA workshop the week after next, with the follow abstract:
We introduce Q-automata to model quality aspects of component-based software. We propose Q-algebras as a general framework that allows us to combine and choose between quality …
read moreUsing Reo and Constraint Automata in Hardware-Software Co-design
Hardware engineering shows that building systems from components has significant benefits. Using components permits hardware engineers to develop systems in a modular way, making it possible for them to build and reason about systems that would otherwise be too large and complex to understand. It also enables them to make …
read moreA logic for strong late bisimilarity (Part II)
We define logical counterparts forconstructions including dynamic name allocation and name exponentiation and show that they are dual to standard constructs in functor categories. In particular, we show that the final coalgebra of a functor defined by Stark and Fiore, Moggi and Sangiorgi in terms of these constructs give rise …
read moreMoCha: it ain't Java!
MoCha is a model of distributed computing developed at CWI wherein components interact via mobile channels. I will introduce MoCha, give some examples, and discuss our new C++ implementation, along with some things we've learned in implementing and applying it.
read moreA logic for strong late bisimilarity
We define logical counterparts for constructions including dynamic name allocation and name exponentiation and show that they are dual to standard constructs in functor categories. In particular, we show that the final coalgebra of a functor defined by Stark and Fiore, Moggi and Sangiorgi in terms of these constructs give …
read more