|
|
|
|
| LEADER |
02739nam a22005295i 4500 |
| 001 |
978-94-91216-95-4 |
| 003 |
DE-He213 |
| 005 |
20151218061047.0 |
| 007 |
cr nn 008mamaa |
| 008 |
130730s2013 fr | s |||| 0|eng d |
| 020 |
|
|
|a 9789491216954
|9 978-94-91216-95-4
|
| 024 |
7 |
|
|a 10.2991/978-94-91216-95-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.L63
|
| 050 |
|
4 |
|a QA76.5913
|
| 050 |
|
4 |
|a QA76.63
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a UYF
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 072 |
|
7 |
|a COM036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1015113
|2 23
|
| 100 |
1 |
|
|a Mogavero, Fabio.
|e author.
|
| 245 |
1 |
0 |
|a Logics in Computer Science
|h [electronic resource] :
|b A Study on Extensions of Temporal and Strategic Logics /
|c by Fabio Mogavero.
|
| 264 |
|
1 |
|a Paris :
|b Atlantis Press :
|b Imprint: Atlantis Press,
|c 2013.
|
| 300 |
|
|
|a XVII, 149 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Atlantis Studies in Computing,
|x 2212-8557 ;
|v 3
|
| 505 |
0 |
|
|a Graded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation.
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9789491216947
|
| 830 |
|
0 |
|a Atlantis Studies in Computing,
|x 2212-8557 ;
|v 3
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.2991/978-94-91216-95-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
