History-deterministic Timed Automata

04/06/2023
by   Sougata Bose, et al.
0

We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed thus far. History-determinism is a robust property that admits different game-based characterisations, and HD specifications allow for game-based verification without an expensive determinization step. We show that the class of timed ω-languages recognised by HD timed automata strictly extends that of deterministic ones, and is strictly included in those recognised by fully non-deterministic TA. For non-deterministic timed automata it is known that universality is already undecidable for Büchi TA. For history-deterministic TA with arbitrary parity acceptance, we show that timed universality, inclusion, and synthesis all remain decidable and are EXPTIME-complete. For the subclass of TA with safety or reachability acceptance, one can decide (in EXPTIME) whether such an automaton is history-deterministic. If so, it can effectively determinized without introducing new automata states.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2022

Parikh Automata over Infinite Words

Parikh automata extend finite automata by counters that can be tested fo...
research
05/03/2023

History-deterministic Vector Addition Systems

We consider history-determinism, a restricted form of non-determinism, f...
research
05/07/2023

From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism

We study transformations of automata and games using Muller conditions i...
research
10/16/2017

A Hierarchy of Scheduler Classes for Stochastic Automata

Stochastic automata are a formal compositional model for concurrent stoc...
research
06/27/2018

A Game-Semantic Model of Computation, Revisited: An Automata-Theoretic Perspective

In the previous work, we have given a novel, game-semantic model of comp...
research
12/29/2020

Approximate Automata for Omega-Regular Languages

Automata over infinite words, also known as omega-automata, play a key r...
research
01/07/2020

VC-dimensions of nondeterministic finite automata for words of equal length

Ishigami and Tani studied VC-dimensions of deterministic finite automata...

Please sign up or login with your details

Forgot password? Click here to reset