Temporal Logic in Finite-State Verification
978-613-0-52701-3
6130527012
88
2010-05-19
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786130527013.jpg
https://images.our-assets.com/fullcover/230x230/9786130527013.jpg
https://images.our-assets.com/cover/2000x/9786130527013.jpg
https://images.our-assets.com/fullcover/2000x/9786130527013.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.
https://www.morebooks.de/books/ru/published_by/betascript-publishing/1/products
Анализ
https://www.morebooks.de/store/ru/book/temporal-logic-in-finite-state-verification/isbn/978-613-0-52701-3