3169 search results - page 59 / 634 » Robust Timed Automata |
CAV
2006
Springer
14 years 14 days ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Polynomially accurate simulations [19] are relations for Probabilistic Automata that require transitions to be matched up to negligible sets provided that computation len...
FOSSACS
2011
Springer
13 years 6 days ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
IJFCS
2008
13 years 8 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
ACRI
2006
Springer
14 years 2 months ago
2006
Springer
This paper presents an application of Cellular Automata in the field of dry Granular Systems modelling. While the study of granular systems is not a recent field, no efficient mo...