732 search results - page 5 / 147 » Axiomatising timed automata |
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. In previous work, a probabilistic notion of time divergence for p...
FUIN
2010
14 years 6 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
78
Voted
HYBRID
1997
Springer
15 years 1 months ago
1997
Springer
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
FORMATS
2004
Springer
15 years 2 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...