Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude

Peter Csaba Olveczky, Pavithra Prabhakar and Xue Liu

We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal logics in the literature, including MTL. We make use of this characterization to show that MTL+Past satisfies an “ultimate stability” property with respect to periodic sequences of timed words. Our results hold for both the pointwise and continuous semantics. Along the way we generalize the result of McNaughton-Papert to show a counter-free automata characterization of FO-definable finitely varying functions.

22nd IEEE International Symposium on Parallel and Distributed Processing (IPDPS)
Download: BIB PS PDF