Your Waterstones card is changing, introducing...
TELL ME MORE
Logics in Computer Science: A Study on Extensions of Temporal and Strategic Logics - Atlantis Studies in Computing 3 (Hardback)
  • Logics in Computer Science: A Study on Extensions of Temporal and Strategic Logics - Atlantis Studies in Computing 3 (Hardback)
zoom

Logics in Computer Science: A Study on Extensions of Temporal and Strategic Logics - Atlantis Studies in Computing 3 (Hardback)

(author)
£74.99
Hardback 149 Pages / Published: 12/08/2013
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket
In this monograph we introduce and examine four new temporal logic formalisms that can be used as specification languages for the automated verification of the reliability of hardware and software designs with respect to a desired behavior. The work is organized in two parts. In the first part two logics for computations, the graded computation tree logic and the computation tree logic with minimal model quantifiers are discussed. These have proved to be useful in describing correct executions of monolithic closed systems. The second part focuses on logics for strategies, strategy logic and memoryful alternating-time temporal logic, which have been successfully applied to formalize several properties of interactive plays in multi-entities systems modeled as multi-agent games.

Publisher: Atlantis Press (Zeger Karssen)
ISBN: 9789491216947
Number of pages: 149
Weight: 421 g
Dimensions: 235 x 155 x 11 mm
Edition: 2013 ed.

You may also be interested in...

Concise Guide to Databases
Added to basket
Machine Learning
Added to basket
£39.99
Paperback
Purely Functional Data Structures
Added to basket
Algorithms Unlocked
Added to basket
Understanding Cryptography
Added to basket
Understanding Cryptography
Added to basket
Algorithms
Added to basket
£66.99
Hardback
Introduction to Algorithms
Added to basket
The End of Error
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.