Skip to Main content Skip to Navigation

Normal Forms and Equivalence of K-periodically Routed Graphs

Anthony Coadou 1 Robert de Simone 1
1 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Document type :
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download
Contributor : Anthony Coadou Connect in order to contact the contributor
Submitted on : Tuesday, June 15, 2010 - 3:55:22 PM
Last modification on : Friday, January 21, 2022 - 3:18:08 AM
Long-term archiving on: : Thursday, September 23, 2010 - 1:14:57 PM


Files produced by the author(s)


  • HAL Id : inria-00485609, version 2



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



Les métriques sont temporairement indisponibles