6533b871fe1ef96bd12d1198
RESEARCH PRODUCT
Finite automata on timed ω-trees
Margherita NapoliSalvatore La Torresubject
Finite-state machineTheoretical computer scienceGeneral Computer Sciencebusiness.industryTimed automatonDecision problemTheoretical Computer ScienceAutomatonDecidabilityReachabilityAutomata theoryArtificial intelligencebusinessComputer Science::Formal Languages and Automata TheoryState transition tableComputer Science(all)Mathematicsdescription
AbstractIn 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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2003-02-01 | Theoretical Computer Science |