Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Logics in Computer Science - A Study on Extensions of Temporal and Strategic Logics

Logics in Computer Science

A Study on Extensions of Temporal and Strategic Logics

Mogavero, Fabio

2013, XVII, 149 p. 13 illus.

A product of Atlantis Press
Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$79.99

(net) price for USA

ISBN 978-94-91216-95-4

digitally watermarked, no DRM

Included Format: PDF and EPUB

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$109.00

(net) price for USA

ISBN 978-94-91216-94-7

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Provides four extensions of classic temporal and strategic logics
  • Comprises new results on expressiveness and succinctness of logics in computer science
  • Includes new techniques for proving upper and lower computational bounds
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.

Content Level » Professional/practitioner

Keywords » Expressiveness - Model Checking - Satisfiability - Succinctness - Temporal and Strategic Logics

Related subjects » Theoretical Computer Science

Table of contents 

Graded Computation Tree Logic.- Minimal Model Quantifiers.- Reasoning About Strategies.- Relentful Strategic Reasoning.- Appendix A Mathematical Notation.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Logics and Meanings of Programs.