×

Memory event clocks. (English) Zbl 1290.68075

Chatterjee, Krishnendu (ed.) et al., Formal modeling and analysis of timed systems. 8th international conference, FORMATS 2010, Klosterneuburg, Austria, September 8–10, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15296-2/pbk). Lecture Notes in Computer Science 6246, 198-212 (2010).
Summary: We introduce logics and automata based on memory event clocks. A memory clock is not really reset: instead, a new clock is created, while the old one is still accessible by indexing. We can thus constrain not only the time since the last reset (which was the main limitation in event clocks), but also since previous resets. When we introduce these clocks in the linear temporal logic of the reals, we create Recursive Memory Event Clocks Temporal Logic (RMECTL). It turns out to have the same expressiveness as the Temporal Logic with Counting (TLC) of Hirshfeld and Rabinovich. We then examine automata with recursive memory event clocks (RMECA). Recursive event clocks are reset by simpler RMECA, hence the name “recursive”. In contrast, we show that for RMECA, memory clocks do not add expressiveness, but only concision. The original RECA define thus a fully decidable, robust and expressive level of real-time expressiveness.
For the entire collection see [Zbl 1195.68001].

MSC:

68Q45 Formal languages and automata
03B44 Temporal logic
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Software:

TREX
PDFBibTeX XMLCite
Full Text: DOI