Static Analysis of Distributed Systems with Mobility Specified by Graph Grammars-A Case Study
We consider a distributed system with mobility modelled as a graph transformation system. Then we show that non-secure level processes cannot influence secure level processes, a property formalized as the absence of causal dependencies between such processes. This is done by resorting to an analysis technique for graph transformation systems, called approximated unfolding, based on the construction of an approximation of the unfolding semantics.
Dieser Eintrag ist freigegeben.