A monitorability hierarchy for a modal mu-calculus with data is established, including a maximal monitorable fragment for least-fixed-point formulas and undecidability of monitorability in the full logic.
In the Maze of Data Languages
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the string and tree cases. In this paper we describe and compare the complexity and expressiveness of such models to understand which ones are better candidates as regular models.
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
A monitorability hierarchy for a modal mu-calculus with data is established, including a maximal monitorable fragment for least-fixed-point formulas and undecidability of monitorability in the full logic.