Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Discrete geometry applied in hard real-time systems validation
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
To validate real-time systems, one must especially validate on the one hand its functional behaviours (by proving that it does what it must do), and on the other hand its operational behaviours (by proving that it respects its time specifications). Here, we deal with the operational aspects. In previous works, we presented a technique, based on finite automata, to validate real-time systems designed to run on a centralised architecture. Here, we extend this approach to distributed systems. The main contribution of this work is to show that, when the modeled physical process is closed, finite automata and product operators are sufficient to valid distributed systems on an operational way.