Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata

Abstract

This paper presents a rewriting logic semantics for parametric timed automata (PTAs) and shows that symbolic reachability analysis using Maude-with-SMT is sound and complete for the PTA reachability problem. We then refine standard Maude-with-SMT reachability analysis so that the analysis terminates when the symbolic state space of the PTA is finite. We show how we can synthesize parameters with our methods, and compare their performance with Imitator, a state-of-the-art tool for PTAs. The practical contributions are two-fold: providing new analysis methods for PTAs - -e.g. allowing more general state properties in queries and supporting reachability analysis combined with user-defined execution strategies - -not supported by Imitator, and developing symbolic analysis methods for real-time rewrite theories.