LFCS Seminar by Reiko Heckel: Rigid Graphs for Adaptive Networks
What 


When 
Oct 21, 2014 from 04:00 PM to 05:00 PM 
Where  4.314.33 
Add event to calendar 
vCal iCal 
Abstract:
Stochastic rulebased models of networks and biological systems are hard to construct and analyse. Refinements help to produce systems at the right level of abstraction, enable analysis techniques and mappings to other formalisms. Rigidity is a property of graphs introduced in Kappa to support stochastic refinement, allowing to preserve the number of matches for rules in the refined system. In this talk: 1) we propose a notion of rigidity in an axiomatic setting based on adhesive categories; 2) we show how the rewriting of rigid structures can be defined systematically by requiring matches to be open maps reflecting structural features which ensure that rigidity is preserved; and 3) we obtain in our setting a notion of refinement which generalises that in Kappa, and allows a rule to be partitioned into a set of rules which are collectively equivalent to the original.
We illustrate our approach on an example of a social network with dynamic topology and discuss applications to the energydriven approach to rewriting.