|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-94-91216-95-4 |
003 |
DE-He213 |
005 |
20220127110142.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
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM051000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
100 |
1 |
|
|a Mogavero, Fabio.
|e author.
|4 aut
|4 http://id.loc.gov/vocabulary/relators/aut
|
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.
|
250 |
|
|
|a 1st ed. 2013.
|
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-8565 ;
|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 Machine theory.
|
650 |
|
0 |
|a Algorithms.
|
650 |
1 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
650 |
2 |
4 |
|a Algorithms.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9789462390560
|
776 |
0 |
8 |
|i Printed edition:
|z 9789491216961
|
776 |
0 |
8 |
|i Printed edition:
|z 9789491216947
|
830 |
|
0 |
|a Atlantis Studies in Computing,
|x 2212-8565 ;
|v 3
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.2991/978-94-91216-95-4
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SMA
|
912 |
|
|
|a ZDB-2-SXMS
|
950 |
|
|
|a Mathematics and Statistics (SpringerNature-11649)
|
950 |
|
|
|a Mathematics and Statistics (R0) (SpringerNature-43713)
|