Sciweavers

570 search results - page 2 / 114
» Robustness and Implementability of Timed Automata
Sort
View
HYBRID
1997
Springer
13 years 9 months ago
Robust Timed Automata
We de ne robust timed automata, which are timed automata that accept all trajectories \robustly": if a robust timed automaton accepts a trajectory, then it must accept neighbo...
Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesa...
ICIAP
1999
ACM
13 years 9 months ago
Cellular Automata Based Optical Flow Computation for "Just-in-Time" Applications
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
Giovanni Adorni, Stefano Cagnoni, Monica Mordonini
SERA
2007
Springer
13 years 11 months ago
A Formal Approach to Test the Robustness of Embedded Systems using Behaviour Analysis
Robustness is an important feature required for embedded systems. This paper presents a methodology to test robustness of such systems. We investigate system behaviour aspects. We...
Antoine Rollet, Fares Saad-Khorchef
FORMATS
2006
Springer
13 years 8 months ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
FORMATS
2005
Springer
13 years 10 months ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis