English
Related papers

Related papers: Monitorability of $\omega$-regular languages

200 papers

Despite recent concerns about undesirable behaviors generated by large language models (LLMs), including non-factual, biased, and hateful language, we find LLMs are inherent multi-task language checkers based on their latent representations…

Computation and Language · Computer Science 2023-04-10 Tianhua Zhang , Hongyin Luo , Yung-Sung Chuang , Wei Fang , Luc Gaitskell , Thomas Hartvigsen , Xixin Wu , Danny Fox , Helen Meng , James Glass

Recently we proposed relative observability for supervisory control of discrete-event systems under partial observation. Relative observability is closed under set unions and hence there exists the supremal relatively observable sublanguage…

Systems and Control · Computer Science 2016-09-09 Kai Cai , Renyuan Zhang , W. M. Wonham

We present an approach for verifying systems at runtime. Our approach targets distributed systems whose components communicate with monitors over unreliable channels, where messages can be delayed, reordered, or even lost. Furthermore, our…

Logic in Computer Science · Computer Science 2019-09-26 David Basin , Felix Klaedtke , Eugen Zalinescu

In runtime verification, manually formalizing a specification for monitoring system executions is a tedious and error-prone process. To address this issue, we consider the problem of automatically synthesizing formal specifications from…

Artificial Intelligence · Computer Science 2023-10-27 Ritam Raha , Rajarshi Roy , Nathanael Fijalkow , Daniel Neider , Guillermo A. Perez

We consider a class of systems over finite alphabets with linear internal dynamics, finite-valued control inputs and finitely quantized outputs. We motivate the need for a new notion of observability and propose three new notions of output…

Optimization and Control · Mathematics 2016-07-13 Donglei Fan , Danielle C. Tarraf

We consider the problem of monitoring a Linear Time Logic (LTL) specification that is defined on infinite paths, over finite traces. For example, we may need to draw a verdict on whether the system satisfies or violates the property "p…

Logic in Computer Science · Computer Science 2018-04-11 Ezio Bartocci , Roderick Bloem , Dejan Nickovic , Franz Roeck

Linear Temporal Logic (LTL) interpreted on finite traces is a robust specification framework popular in formal verification. However, despite the high interest in the logic in recent years, the topic of their quantitative extensions is not…

Logic in Computer Science · Computer Science 2021-01-05 Bartosz Bednarczyk , Jakub Michaliszyn

Linear Temporal Logic (LTL) is a widely used specification framework for linear time properties of systems. The standard approach for verifying such properties is by transforming LTL formulae to suitable $\omega$-automata and then applying…

Formal Languages and Automata Theory · Computer Science 2017-10-19 Martin Sulzmann , Peter Thiemann

Runtime Verification is a lightweight formal verification technique. It is used to verify at runtime whether the system under analysis behaves as expected. The expected behaviour is usually formally specified by means of properties, which…

Logic in Computer Science · Computer Science 2021-10-26 Angelo Ferrando , Rafael C. Cardoso

Techniques for runtime verification often utilise specification languages that are (i) reasonably expressive, and (ii) relatively abstract (i.e. they operate on a level of abstraction that separates them from the system being monitored).…

Logic in Computer Science · Computer Science 2018-06-11 Joshua Heneage Dawes , Giles Reger

Linear Temporal Logic (LTL) is a widely used task specification language for autonomous systems. To mitigate the significant manual effort and expertise required to define LTL-encoded tasks, several methods have been proposed for…

Computation and Language · Computer Science 2026-02-23 David Smith Sundarsingh , Jun Wang , Jyotirmoy V. Deshmukh , Yiannis Kantaros

Monitorability delineates what properties can be verified at runtime. Although many monitorability definitions exist, few are defined explicitly in terms of the guarantees provided by monitors, i.e., the computational entities carrying out…

Logic in Computer Science · Computer Science 2019-06-04 Luca Aceto , Antonis Achilleos , Adrian Francalanza , Anna Ingólfsdóttir , Karoliina Lehtinen

We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…

Logic in Computer Science · Computer Science 2022-06-14 Balder ten Cate , Raoul Koudijs

Signal Temporal Logic (STL) is a convenient formalism to express bounded horizon properties of autonomous critical systems. STL extends LTL to real-valued signals and associates a non-singleton bound interval to each temporal operators. In…

Logic in Computer Science · Computer Science 2023-11-17 Céline Bellanger , Pierre-Loïc Garoche , Matthieu Martel , Célia Picard

Omega-powers of finitary languages are languages of infinite words (omega-languages) in the form V^omega, where V is a finitary language over a finite alphabet X. They appear very naturally in the characterizaton of regular or context-free…

Logic in Computer Science · Computer Science 2008-03-12 Dominique Lecomte , Olivier Finkel

Behavioral evaluation is the dominant paradigm for assessing alignment in large language models (LLMs). In current practice, observed compliance under finite evaluation protocols is treated as evidence of latent alignment. However, the…

Machine Learning · Computer Science 2026-02-10 Igor Santos-Grueiro

We examine one particular dimension of AI governance: how to monitor and audit AI-enabled products and services throughout the AI development lifecycle, from pre-deployment testing to post-deployment auditing. Combining principles from…

Artificial Intelligence · Computer Science 2026-05-18 Parand A. Alamdari , Toryn Q. Klassen , Sheila A. McIlraith

Runtime monitoring is one of the central tasks in the area of operational decision support for business process management. In particular, it helps process executors to check on-the-fly whether a running process instance satisfies business…

Logic in Computer Science · Computer Science 2020-04-08 Giuseppe De Giacomo , Riccardo De Masellis , Fabrizio Maria Maggi , Marco Montali

Large Language Models (LLMs) are increasingly used in empirical software engineering (ESE) to automate or assist annotation tasks such as labeling commits, issues, and qualitative artifacts. Yet the reliability and reproducibility of such…

Software Engineering · Computer Science 2026-01-27 Mia Mohammad Imran , Tarannum Shaila Zaman

Natural language understanding is one of the most challenging topics in artificial intelligence. Deep neural network methods, particularly large language module (LLM) methods such as ChatGPT and GPT-3, have powerful flexibility to adopt…

Computation and Language · Computer Science 2023-04-24 Xiaolin Hu