Symbolic system synthesis in the presence of stringent real-time constraints

  • Authors:
  • Felix Reimann;Martin Lukasiewycz;Michael Glass;Christian Haubelt;Jürgen Teich

  • Affiliations:
  • University of Erlangen-Nuremberg, Germany;TU Munich, Germany;University of Erlangen-Nuremberg, Germany;University of Erlangen-Nuremberg, Germany;University of Erlangen-Nuremberg, Germany

  • Venue:
  • Proceedings of the 48th Design Automation Conference
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Stringent real-time constraints lead to complex search spaces containing only very few or even no valid implementations. Hence, while searching for a valid implementation a substantial amount of time is spent on timing analysis during system synthesis. This paper presents a novel system synthesis approach that efficiently prunes the search space in case real-time constraints are violated. For this purpose, the reason for a constraint violation is analyzed and a deduced encoding removes it permanently from the search space. Thus, the approach is capable of proving both the presence and absence of a correct implementation. The key benefit of the proposed approach stems from its integral support for real-time constraint checking. Its efficiency, however, results from the power of deduction techniques of state-of-the-art Boolean Satisfiability (SAT) solvers. Using a case study from the automotive domain, experiments show that the proposed system synthesis approach is able to find valid implementations where former approaches fail. Moreover, it is up to two orders of magnitude faster compared to a state-of-the-art approach.