In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
Giovanni Conforti, Damiano Macedonio, Vladimiro Sa...
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...
This paper proposes GenericDiff, a general framework for model comparison. The main idea is to separate the specification of domain-specific model properties and syntax from the g...