𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classes of Timed Automata and the Undecidability of Universality

✍ Scribed by Arnaldo V. Moura; Guilherme A. Pinto

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
254 KB
Volume
65
Category
Article
ISSN
1571-0661

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The power of reachability testing for ti
The power of reachability testing for timed automata
✍ Luca Aceto; Patricia Bouyer; Augusto BurgueΓ±o; Kim G Larsen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 824 KB

The computational engine of the veriΓΏcation tool UPPAAL consists of a collection of e cient algorithms for the analysis of reachability properties of systems. Model-checking of properties other than plain reachability ones may currently be carried out in such a tool as follows. Given a property to m

Universality and decidability of number-
Universality and decidability of number-conserving cellular automata
✍ AndrΓ©s Moreira πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 138 KB

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the deΓΏnition of the property to include cellular automata with any set

On the universality classes of the Henon
On the universality classes of the Henon map
✍ Paulo R. Hauser; Evaldo M.F. Curado; Constantino Tsallis πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 198 KB
The use of lists in the study of undecid
The use of lists in the study of undecidable problemsin automata theory
✍ J. Hartmanis; F.D. Lewis πŸ“‚ Article πŸ“… 1971 πŸ› Elsevier Science 🌐 English βš– 496 KB

Many of the problems in automata theory are unsolvable and can be classified into degrees of unsolvability by their relative difficulty. In this note, natural reference sets are presented which belong to the complete degrees at each level of the arithmetic hierarchy. Also, some questions regarding l