Finite automata on timed \(\omega\)-trees
type: Item
instance of: scholarly article
title: Finite automata on timed \(\omega\)-trees
zbMATH Open document ID: 1032.68095
DOI: 10.1016/S0304-3975(02)00611-4
author: Salvatore La Torre
author: Margherita Napoli
published in: Theoretical Computer Science
publication date: 2003-07-01T00:00:00Z
review text: A theory of timed \(\omega\)-trees which extends both the theory of timed \(\omega\)-sequences and the theory of \(\omega\)-trees is presented. The main problems discussed in this paper are the complexity of decision problems and their applications to system verification and analysis.
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1944742
zbMATH Keywords: \(\omega\)-trees
zbMATH Keywords: timed \(\omega\)-trees
reviewed by: Cristian S. Calude
MaRDI profile type: Publication
cites work: Model-checking in dense real-time
cites work: A theory of timed automata
cites work: Q4249561
cites work: Q5525343
cites work: Solving Sequential Conditions by Finite-State Strategies
cites work: Q4385542
cites work: Q4736990
cites work: Q4270068
cites work: Discrete-time control for rectangular hybrid automata
cites work: Q5592246
cites work: Q4472440
cites work: Timed tree automata with an application to temporal logic.
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Infinite games played on finite graphs
cites work: Proving Liveness Properties of Concurrent Programs
cites work: Q4205072
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5616162
cites work: Q4074888
cites work: Q4385530
cites work: On the synthesis of strategies in infinite games
cites work: Q4490750
full work available at URL: s0304-3975(02)00611-4
OpenAlex ID: W2068192624
description: scientific article; zbMATH DE number 1944742