Normal Forms and Equivalence of K-periodically Routed Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2010

Normal Forms and Equivalence of K-periodically Routed Graphs

Abstract

We introduce K-periodically Routed Graphs, which are extensions of Marked Graphs with routing nodes, governed by ultimately periodic binary sequences. We study data relations and dependencies, as well as equational transformations of the network topology. We show the existence of expanded normal forms. We prove that some transformations preserve external flow equivalence. Issues arising from internal flow interleavings and permutations are also tackled.
Fichier principal
Vignette du fichier
RR-7286.pdf (436.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00485609 , version 1 (21-05-2010)
inria-00485609 , version 2 (15-06-2010)

Identifiers

  • HAL Id : inria-00485609 , version 2

Cite

Anthony Coadou, Robert de Simone. Normal Forms and Equivalence of K-periodically Routed Graphs. [Research Report] RR-7286, INRIA. 2010. ⟨inria-00485609v2⟩
149 View
135 Download

Share

Gmail Facebook Twitter LinkedIn More