Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata
- Title
- Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata
- Authors
- Arias, Jaime; Bae, Kyungmin; Olarte, Carlos; Ölveczky, Peter Csaba; Petrucci, Laure; Rømming, Fredrik
- Date Issued
- 2022-12-07
- Publisher
- Association for Computing Machinery, Inc
- 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.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/115761
- Article Type
- Conference
- Citation
- 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems, FTSCS 2022, co-located with the ACM SIGPLAN Conference on, page. 3 - 15, 2022-12-07
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.