570 search results - page 7 / 114 » Robustness and Implementability of Timed Automata |
CONCUR
2010
Springer
15 years 22 days ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
FORMATS
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
116
Voted
RTSS
2008
IEEE
15 years 6 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...
106
Voted
CONCUR
2012
Springer
13 years 2 months ago
2012
Springer
Networks of timed automata (NTA) are widely used to model distributed real-time systems. Quite often in the literature, the automata are allowed to share clocks. This is a problem ...
119
click to vote
SDL
2001
15 years 1 months ago
2001
Abstract. We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With res...