Finite automata on timed ω-trees

Authors:
Salvatore La Torre;Margherita Napoli
Affiliations:
CIS Department, University of Pennsylvania, 200 South 33rd Street, Philadelphia, PA and Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, Via S. Allende, Baronis ...;Dipartimento di Informatica ed Applicazioni, Università degli Studi di Salerno, Via S. Allende, Baronissi (SA) I-84081, Italy
Venue:
Theoretical Computer Science
Year:
2003

Citing 15
Cited 4

Automata-Theoretic techniques for modal logics of programs

Journal of Computer and System Sciences
On the synthesis of a reactive module

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Model-checking in dense real-time

Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A theory of timed automata

Theoretical Computer Science
Discrete-time control for rectangular hybrid automata

Theoretical Computer Science
Proving Liveness Properties of Concurrent Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata on Infinite Objects and Church's Problem

Automata on Infinite Objects and Church's Problem
Timed tree automata with an application to temporal logic

Acta Informatica
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Nontraditional Applications of Automata Theory

TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Automata-Theoretic Decision of Timed Games

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Verification of reactive systems and decision problems in temporal logic

Verification of reactive systems and decision problems in temporal logic

Weak Muller Acceptance Conditions for Tree Automata

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Automata-Theoretic Decision of Timed Games

VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Weak Muller acceptance conditions for tree automata

Theoretical Computer Science
Automata-theoretic decision of timed games

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In the last decade Alur and Dill introduced a model of automata on timed ω-sequences which extends the traditional models of finite automata. In this paper, we present a theory of timed ω-trees which extends both the theory of timed ω-sequences and the theory of ω-trees. The main motivation is to introduce a new way of specifying real-time systems and provide tools for studying decidability problems in related fields. We focus on the decision problems and their applications in system verification and synthesis.