DeepAI

# Büchi-Kamp Theorems for 1-clock ATA

This paper investigates Kamp-like and Büchi-like theorems for 1-clock Alternating Timed Automata (1-ATA) and its natural subclasses. A notion of 1-ATA with loop-free-resets is defined. This automaton class is shown to be expressively equivalent to the temporal logic which is MTL[F_I] extended with a regular expression guarded modality. Moreover, a subclass of future timed MSO with k-variable-connectivity property is introduced as logic . In a Kamp-like result, it is shown that is expressively equivalent to . As our second result, we define a notion of conjunctive-disjunctive 1-clock ATA ( 1-ATA). We show that 1-ATA with loop-free-resets are expressively equivalent to the sublogic of . Moreover is expressively equivalent to , the two-variable connected fragment of . The full class of 1-ATA is shown to be expressively equivalent to extended with fixed point operators.

• 6 publications
• 2 publications
• 1 publication
07/27/2021

### Logics Meet 2-Way 1-Clock Alternating Timed Automata

In this paper, we study the extension of 1-clock Alternating Timed Autom...
08/13/2018

### Timed context-free temporal logics (extended version)

The paper is focused on temporal logics for the description of the behav...
08/13/2018

### Timed context-free temporal logics

The paper is focused on temporal logics for the description of the behav...
09/10/2018

### The Power of the Weak

A landmark result in the study of logics for formal verification is Jani...
02/18/2019

### Approximations of Isomorphism and Logics with Linear-Algebraic Operators

Invertible map equivalences are approximations of graph isomorphism that...
03/09/2018

### Clocked Definitions in HOL

Many potentially non-terminating functions cannot be directly defined in...
09/24/2019

### Dynamic Complexity of Document Spanners

The present paper investigates the dynamic complexity of document spanne...