33 search results - page 1 / 7 » From Mtl to Deterministic Timed Automata |
FORMATS
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic MTL, under bounded-variability assumptions. We handle fu...
CAV
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we propose a complete chain for synthesizing controllers from high-level specifications. From real-time properties expressed in the logic MTL we generate, under boun...
FOSSACS
2011
Springer
13 years 2 months 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...
ICTAC
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number of times that a subexpression should be m...
JSAC
2006
13 years 11 months ago
2006
The characterization of the transfer function of the power line (PL) channel is a nontrivial task that requires a truly interdisciplinary approach. Until recently, a common attribu...