732 search results - page 32 / 147 » Axiomatising timed automata |
RTSS
2008
IEEE
14 years 3 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...
FORMATS
2003
Springer
14 years 2 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
FORTE
2007
13 years 10 months ago
2007
Abstract. The publish-subscribe architectural style has recently emerged as a promising approach to tackle the dynamism of modern distributed applications. The correctness of these...
ACTA
2010
13 years 9 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
ICST
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract—In this paper we introduce Timed Moore Automata, a specification formalism which is used in industrial train control applications for specifying the real-time behavior ...