Formal analysis of real-time systems with user-defined strategies in rewriting logic

• Published in: Journal of logical and algebraic methods in programming Vol. 146; p. 101072
• Main Authors: Olarte, Carlos, Ölveczky, Peter Csaba
• Format: Journal Article
• Language: English
• Published: Elsevier Inc 01.07.2025
• Subjects: Execution strategies; LTL model checking; Maude; Reachability analysis; Real-time Maude; Real-time systems; Rewriting logic; Time sampling; Execution strategies; Rewriting logic; LTL model checking; Maude; Time sampling; Real-time Maude; Real-time systems; Reachability analysis
• ISSN: 2352-2208
• DOI: 10.1016/j.jlamp.2025.101072

A wide range of real-time systems, formalisms, and modeling languages can be naturally represented in rewriting logic as real-time rewrite theories. In this paper we propose a language in which the user can conveniently define execution strategies—including state- and history-dependent ones—for real-time rewrite theories in a modular way, by specifying: (i) how to apply instantaneous transitions; (ii) how to advance time in the system; and (iii) the interplay between instantaneous transitions and advancing time. The user can easily specify more “time sampling strategies” than those supported by the Real-Time Maude tool, and we identify a new time sampling strategy that provides both efficient and exhaustive analysis for many distributed real-time systems. We provide unbounded and time-bounded simulation, reachability analysis, and LTL model checking commands for real-time rewrite theories whose executions are constrained by the user-defined discrete and timed strategies. These analysis methods are implemented by defining a strategy which extends the user's strategy, so that all analysis boils down to standard Maude rewriting with strategies. We exemplify the use of our strategy language and our analyses on a round trip time protocol and a train door controller. Our work also provides analysis with respect to user-defined strategies for formalisms that can be seen as real-time theories; we illustrate this for timed automata. Finally, we compare the performance of standard Maude search, where the desired time sampling strategy has been hardcoded into the model, with our strategy-implemented reachability analyses on the CASH scheduling algorithm benchmark.