Издательство: | Книга по требованию |
Дата выхода: | июль 2011 |
ISBN: | 978-6-1305-2701-3 |
Объём: | 88 страниц |
Масса: | 153 г |
Размеры(В x Ш x Т), см: | 23 x 16 x 1 |
High Quality Content by WIKIPEDIA articles! In finite-state verification, model checkers examine finite-state machines representing concurrent software systems looking for errors in design. Errors are defined as violations of requirements expressed as properties of the system. In the event that the finite-state machine fails to satisfy the property, a model checker is in some cases capable of producing a counterexample – an execution of the system demonstrating how the error occurs. Property specifications are often written as Linear Temporal Logic (LTL) expressions. Once a requirement is expressed as an LTL formula, a model checker can automatically verify this property against the model.
Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.