101 search results - page 8 / 21 » When Are Timed Automata Determinizable |
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...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
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...
TSE
2010
13 years 6 months ago
2010
Abstract—In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial stud...
ACRI
2008
Springer
14 years 2 months ago
2008
Springer
This article studies the convergence properties of some 2D cellular automata, when a single cell is updated at random at each time step. We tackle this question for a particular s...