Validating time-constrained systems using UML statecharts patterns and timed automata observers
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
| Hi-index | 0.00 |
Testing cannot cover all execution schedules in concurrent software. Model checking, however, is capable of verifying the outcome of all possible executions. It has been applied successfully to networked software, with all processes being analyzed in conjunction. Unfortunately, this approach does not scale very well. This paper presents a partial-order reduction through which a performance gain of up to 70% was achieved.