We will define new constructions similar to the graph systems of correspondences described by Deaconu et al. We will use these to prove a version of Ionescus theorem for higher rank graphs. Afterwards we will examine the properties of these construct
ions further and make contact with Yeends topological k-graphs and the tensor groupoid valued product systems of Fowler and Sims.
