Synthia: verification and synthesis for timed automata

  • Authors:
  • Hans-Jörg Peter;Rüdiger Ehlers;Robert Mattmüller

  • Affiliations:
  • Reactive Systems Group, Saarland University, Germany;Reactive Systems Group, Saarland University, Germany;Foundations of Artificial Intelligence Group, Freiburg University, Germany

  • Venue:
  • CAV'11 Proceedings of the 23rd international conference on Computer aided verification
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present Synthia, a new tool for the verification and synthesis of open real-time systems modeled as timed automata. The key novelty of Synthia is the underlying abstraction refinement approach [5] that combines the efficient symbolic treatment of timing information by difference bound matrices (DBMs) with the usage of binary decision diagrams (BDDs) for the discrete parts of the system description. Our experiments show that the analysis of both closed and open systems greatly benefits from identifying large relevant and irrelevant system parts on coarse abstractions early in the solution process. Synthia is licensed under the GNU GPL and available from our website.