This work considers a definitional fragment of Temporal Equilibrium Logic, which allows to capture temporal rules that contain complex (implication-free) temporal formulas in rule bodies, and shows how the set of all stable models of a theory can be represented as a non-deterministic finite state automaton (NFA).
When safety-critical systems are developed from a known internal specification, their correctness can be established by model checking. In the frequent case where such a specification is unknown or inaccessible, runtime verification presents an attractive alternative, e.g., to ascertain that autonomous and agentic syst...
Sarah Winkler, Toryn Q. Klassen, Sheila A. McIlraith et al.· 0 citations
Linear-time temporal properties, such as those described by Linear-time Temporal Logic, are typically modelled as sets of infinite traces. Yet, in a run-time verification context, such as when testing or monitoring a system, only a finite prefix of the system's behaviour can be observed. For some properties, these fini...
Rayhana Amjad, R. V. van Glabbeek, Liam O'Connor· Information and Computation· 0 citations
Computation Tree Logic (CTL) is a fundamental formalism for specifying and reasoning about the behavior of non-terminating systems. Due to the lack of uniform interpolation (UI) property, CTL is usually limited in modular reasoning and system abstraction. This paper studies uniform interpolation in CTL fragments with r...
Ren-Yan Feng, Yisong Wang, Ming-Sen Deng et al.· Proceedings of the Thirty-Fi...· 0 citations
A coNEXPTIME upper bound for the validity problem of RmbC and a coNP-hardness lower bound are established, and coNP-completeness for the principal extensions containing one of the six minimal explosive pairs are proved.
We present a domain-theoretical formalization of interaction trees in the Rocq prover. Unlike existing formalizations, ours does not rely on Rocq's built-in coinduction. Hence, we avoid complications occurring in earlier works, such as artificially including silent steps to comply with Rocq's productivity checker, trea...
David Nowak, Vlad Rusu· Electronic Proceedings in Th...· 0 citations
A new class of automata running on infinite trees of arbitrary arity is introduced, and several algorithms to perform classical operations are developed for those automata and precisely characterise their complexities.
François Laroussinie, Nicolas Markey· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
