History-deterministic Timed Automata

History-deterministic Timed Automata

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Sougata Bose, Thomas A. Henzinger, Karoliina Lehtinen, Sven Schewe, Patrick Totzke
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2024-10-01
Series:Logical Methods in Computer Science
Subjects:
computer science - formal languages and automata theory
computer science - logic in computer science
Online Access:http://lmcs.episciences.org/11166/pdf
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

http://lmcs.episciences.org/11166/pdf

Similar Items