93 search results - page 6 / 19 » Weak Alternating Timed Automata |
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
We give logical characterizations of bisimulation relations for the probabilistic automata of Segala in terms of three Hennessy-Milner style logics. The three logics characterize s...
ECCC
2000
13 years 7 months ago
2000
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
IJFCS
2006
13 years 7 months ago
2006
ion for Parametric Time-Interval Automata Akio Nakata, Tadaaki Tanimoto, Suguru Sasaki, Teruo Higashino Department of Information Networking, Graduate School of Information Science...
ICST
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...
CONCUR
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...