101 search results - page 15 / 21 » When Are Timed Automata Determinizable |
RTAS
2008
IEEE
14 years 2 months ago
2008
IEEE
In previous work we have shown how modular code can be automatically generated from a synchronous block diagram notation where all blocks fire at all times. Here, we extend this ...
CONCUR
1992
Springer
13 years 11 months ago
1992
Springer
The states of a computing system bear information and change time, while its events bear time and change information. We develop a primitive algebraic model of this duality of tim...
ENTCS
2006
13 years 7 months ago
2006
In multilevel systems it is important to avoid unwanted indirect information flow from higher levels to lower levels, namely the so called covert channels. Initial studnformation ...
RTSS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
FUIN
2006
13 years 7 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...