Copenhagen Programming Language Seminar
In this talk we will discuss directed bigraphs and directed bigraphical reactive systems. Directed bigraphs are a variant of pure bigraphs (i.e., without bindings) with a notion of "global, location-less resources" (or "knowledge tokens"); arcs represent control's accesses to these resources.
This version of bigraphs subsume and generalize both original Milnerís and Sassone-Sobocinskiís variants, also regarding the constructions of relative pushouts and idem-pushouts. Moreover, they can be given also a sound and complete axiomatization.
Thanks to these results, directed bigraphs can be used for describing computational models, allowing for the construction of IPO-labelled transition systems; the corresponding bisimulations are always congruences.Under mild syntactic conditions about the reaction rules, these LTSs can be pruned further by restricting to a subclass of labels.In order to demonstrate the encoding methodology, we consider in detail the case of Fusion calculus, which was uncovered by previous versions of bigraphs.
If time permits, we will touch upon a slightly yet natural extended version of directed bgs, and their examples (such as service-oriented architectures, Petri nets, chemical reactions).
All are welcome.
The Copenhagen Programming Language Seminar (COPLAS) is a collaboration between DIKU, ITU, KVL and RUC.
COPLAS is sponsored by the FIRST Graduate School.
To receive information about COPLAS talks by email, send a message to firstname.lastname@example.org with the word 'subscribe' as subject or in the body.
For more information about COPLAS, see http://www.coplas.org