Next Article in Journal
The Role of Analytical Frameworks for Systemic Research Design, Explained in the Analysis of Drivers and Dynamics of Historic Land-Use Changes
Next Article in Special Issue
From Systems to Organisations
Previous Article in Journal
A Balance Paradigm for Post-Plutocracy: Toward Sustainable Development with Integral Harmony
Previous Article in Special Issue
Transdisciplinarity Needs Systemism
Article Menu

Export Article

Open AccessArticle
Systems 2017, 5(1), 17; doi:10.3390/systems5010017

Formal Proof of the Dependable Bypassing Routing Algorithm Suitable for Adaptive Networks on Chip QnoC Architecture

1
Laboratory of Informatics and Mathematics (LIM), University of Tiaret, Tiaret 14000, Algeria
2
Laboratoire de Conception, Optimisation et Modélisation des Systèmes (LCOMS), ASEC Team, Université de Lorraine, Metz 57070, France
*
Author to whom correspondence should be addressed.
Academic Editors: Gianfranco Minati, Eliano Pessa and Ignazio Licata
Received: 31 October 2016 / Revised: 11 January 2017 / Accepted: 20 January 2017 / Published: 22 February 2017

Abstract

Approaches for the design of fault tolerant Network-on-Chip (NoC) for use in System-on-Chip (SoC) reconfigurable technology using Field-Programmable Gate Array (FPGA) technology are challenging, especially in Multiprocessor System-on-Chip (MPSoC) design. To achieve this, the use of rigorous formal approaches, based on incremental design and proof theory, has become an essential step in the validation process. The Event-B method is a promising formal approach that can be used to develop, model and prove accurately SoC and MPSoC architectures. This paper proposes a formal verification approach for NoC architecture including the dependability constraints relating to the choice of the path routing of data packets and the strategy imposed for diversion when faulty routers are detected. The formalization process is incremental and validated by correct-by-construction development of the NoC architecture. Using the concepts of graph colouring and B-event formalism, the results obtained have demonstrated its efficiency for determining the bugs, and a solution to ensure a fast and reliable operation of the network when compared to existing similar methods. View Full-Text
Keywords: network on chip; switch and adaptive-routing; event-B formalism; formal proof; correct-by-construction network on chip; switch and adaptive-routing; event-B formalism; formal proof; correct-by-construction
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Daoud, H.; Tanougast, C.; Belarbi, M.; Heil, M.; Diou, C. Formal Proof of the Dependable Bypassing Routing Algorithm Suitable for Adaptive Networks on Chip QnoC Architecture. Systems 2017, 5, 17.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Systems EISSN 2079-8954 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top