English
Related papers

Related papers: Interrupt Timed Automata with Auxiliary Clocks and…

200 papers

Continual learning is a fundamental challenge in artificial intelligence that requires networks to acquire new knowledge while preserving previously learned representations. Despite the success of various approaches, most existing paradigms…

Machine Learning · Computer Science 2026-02-24 Patryk Krukowski , Jan Miksa , Piotr Helm , Jacek Tabor , Paweł Wawrzyński , Przemysław Spurek

Nonlinear ICA is a fundamental problem for unsupervised representation learning, emphasizing the capacity to recover the underlying latent variables generating the data (i.e., identifiability). Recently, the very first identifiability…

Machine Learning · Statistics 2019-02-05 Aapo Hyvarinen , Hiroaki Sasaki , Richard E. Turner

Encountering shifted data at test time is a ubiquitous challenge when deploying predictive models. Test-time adaptation (TTA) methods address this issue by continuously adapting a deployed model using only unlabeled test data. While TTA can…

Machine Learning · Computer Science 2025-11-11 Mona Schirmer , Metod Jazbec , Christian A. Naesseth , Eric Nalisnick

In this paper, we study the extension of 1-clock Alternating Timed Automata (1-ATA) with the ability to read in both forward and backward direction, the 2-Way 1-clock Alternating Timed Automata (2-Way 1-ATA). We show that subclass of 2-Way…

Formal Languages and Automata Theory · Computer Science 2022-03-01 Shankara Narayanan Krishna , Khushraj Nanik Madnani , Manuel Mazo , Paritosh K. Pandya

The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce \emph{automata with delay blocks} (ADBs), extending finite state…

Formal Languages and Automata Theory · Computer Science 2012-08-14 Krishnendu Chatterjee , Thomas A. Henzinger , Vinayak S. Prabhu

A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…

Formal Languages and Automata Theory · Computer Science 2022-01-14 Evgeniya A. Bondar , David Casas , Mikhail V. Volkov

The paper studies some important properties of the asynchronous (=timed) automata: the delay-insensitivity, the hazard-freedom, the semi-modularity and the technical condition of good running. Time is discrete.

Logic in Computer Science · Computer Science 2007-05-23 Serban E. Vlad

Requirements engineering is a key phase in the development process. Ensuring that requirements are consistent is essential so that they do not conflict and admit implementations. We consider the formal verification of rt-consistency, which…

Formal Languages and Automata Theory · Computer Science 2020-07-09 Thierry Jéron , Nicolas Markey , David Mentré , Reiya Noguchi , Ocan Sankur

This paper studies the problem of event-triggered impulsive control for discrete-time systems. A novel periodic event-triggering scheme with two tunable parameters is presented to determine the moments of updating impulsive control signals…

Optimization and Control · Mathematics 2023-04-28 Kexue Zhang , Elena Braverman

Animals exploit time to survive in the world. Temporal information is required for higher-level cognitive abilities such as planning, decision making, communication, and effective cooperation. Since time is an inseparable part of cognition,…

Artificial Intelligence · Computer Science 2020-12-29 Hamit Basgol , Inci Ayhan , Emre Ugur

This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based)…

Logic in Computer Science · Computer Science 2013-08-14 Carlo A. Furia , Matteo Pradella , Matteo Rossi

Many problems can be specified by patterns of propositional formulae depending on a parameter, e.g. the specification of a circuit usually depends on the number of bits of its input. We define a logic whose formulae, called "iterated…

Logic in Computer Science · Computer Science 2010-01-26 Vincent Aravantinos , Ricardo Caferra , Nicolas Peltier

Symbolic data structures for model checking timed systems have been subject to a significant research, with Difference Bound Matrices (DBMs) still being the preferred data structure in several mature verification tools. In comparison,…

Data Structures and Algorithms · Computer Science 2012-11-28 Kenneth Y. Jørgensen , Kim G. Larsen , Jiří Srba

Alternating automata have been widely used to model and verify systems that handle data from finite domains, such as communication protocols or hardware. The main advantage of the alternating model of computation is that complementation is…

Formal Languages and Automata Theory · Computer Science 2017-08-17 Radu Iosif , Xiao Xu

We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such…

Systems and Control · Electrical Eng. & Systems 2023-09-22 Eric Goubault , Sylvie Putot

In this paper we introduce and study Event-Clock Nested Automata (ECNA), a formalism that combines Event Clock Automata (ECA) and Visibly Pushdown Automata (VPA). ECNA allow to express real-time properties over non-regular patterns of…

Formal Languages and Automata Theory · Computer Science 2017-11-23 Laura Bozzelli , Aniello Murano , Adriano Peron

The forecasting of irregular multivariate time series (IMTS) is crucial in key areas such as healthcare, biomechanics, climate science, and astronomy. However, achieving accurate and practical predictions is challenging due to two main…

Machine Learning · Computer Science 2025-11-18 Xvyuan Liu , Xiangfei Qiu , Xingjian Wu , Zhengyu Li , Chenjuan Guo , Jilin Hu , Bin Yang

We present here Imitator II, a new version of Imitator, a tool implementing the "inverse method" for parametric timed automata: given a reference valuation of the parameters, it synthesizes a constraint such that, for any valuation…

Formal Languages and Automata Theory · Computer Science 2010-11-02 Étienne André

Considering real-valued clocks in timed automata (TA) makes it a practical modeling framework for discrete-event systems. However, the infinite state space brings challenges to the control of TA. To synthesize a supervisor for TA using the…

Systems and Control · Electrical Eng. & Systems 2021-02-19 Aida Rashidinejad , Michel Reniers , Martin Fabian

In this paper we study monitoring of real-time systems with respect to properties expressed either in Metric Interval Temporal Logic or as Timed B\"uchi Automata. We offer efficient symbolic online monitoring algorithms in a number of…

Formal Languages and Automata Theory · Computer Science 2025-09-30 Thomas Møller Grosen , Sean Kauffman , Kim Guldstrand Larsen , Martin Zimmermann
‹ Prev 1 8 9 10 Next ›