10 search results - page 1 / 2 » Integer-Complete Synthesis for Bounded Parametric Timed Auto... |
ENTCS
2007
13 years 4 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
CAV
2007
Springer
13 years 11 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...
FMICS
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper, we concentrate on incremental synthesis of timed automata for automatic addition of different types of bounded response properties. Bounded response
RTSS
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper, we address the problem of symbolically computing the region in the parameter’s space that guarantees a feasible schedule, given a set of real-time tasks character...