_:n3059af24cd0142988d00b550533faa2fxb46
<http://schema.org/description>
"We study monitoring of linear-time arithmetic properties against finite\ntraces generated by an unknown dynamic system. The monitoring state is\ndetermined by considering at once the trace prefix seen so far, and all its\npossible finite-length, future continuations. This makes monitoring at least as\nhard as satisfiability and validity. Traces consist of finite sequences of\nassignments of a fixed set of variables to numerical values. Properties are\nspecified in a logic we call ALTLf, combining LTLf (LTL on finite traces) with\nlinear arithmetic constraints that may carry lookahead, i.e., variables may be\ncompared over multiple instants of the trace. While the monitoring problem for\nthis setting is undecidable in general, we show decidability for (a) properties\nwithout lookahead, and (b) properties with lookahead that satisfy the abstract,\nsemantic condition of finite summary, studied before in the context of model\nchecking. We then single out concrete, practically relevant classes of\nconstraints guaranteeing finite summary. Feasibility is witnessed by a\nprototype implementation."
<https://cdnjs.deepai.org/profile/fabio-patrizi>