Back to Search
Start Over
Controlled timed automata
- Source :
- CONCUR'98 Concurrency Theory ISBN: 9783540648963, CONCUR
- Publication Year :
- 1998
- Publisher :
- Springer Berlin Heidelberg, 1998.
-
Abstract
- We examine some extensions of the basic model, due to Alur and Dill, of real-time automata (RTA). Our model, controlled real-time automata, is a parameterized family of real-time automata with some additional features like clock stopping, variable clock velocities and periodic tests. We illustrate the power of controlled automata by presenting some languages that can be recognized deterministically by such automata, but cannot be recognized non-deterministically by any other previously introduced class of timed automata (even with ɛ-transitions). On the other hand, due to carefully chosen restrictions, controlled automata conserve basic properties of RTA: the emptiness problem is decidable and for each fixed parameter the family of recognized real-time languages is closed under boolean operations.
- Subjects :
- TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES
Nested word
Theoretical computer science
Computer science
Timed automaton
ω-automaton
Nonlinear Sciences::Cellular Automata and Lattice Gases
Mobile automaton
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
Continuous spatial automaton
Quantum finite automata
Automata theory
Hybrid automaton
Algorithm
Computer Science::Formal Languages and Automata Theory
Subjects
Details
- ISBN :
- 978-3-540-64896-3
- ISBNs :
- 9783540648963
- Database :
- OpenAIRE
- Journal :
- CONCUR'98 Concurrency Theory ISBN: 9783540648963, CONCUR
- Accession number :
- edsair.doi...........04099d53f8d129d67ddce8fe589f62ec