000 02701nam a22005175i 4500
001 978-94-91216-95-4
003 DE-He213
005 20140220082947.0
007 cr nn 008mamaa
008 130730s2013 fr | s |||| 0|eng d
020 _a9789491216954
_9978-94-91216-95-4
024 7 _a10.2991/978-94-91216-95-4
_2doi
050 4 _aQA76.9.L63
050 4 _aQA76.5913
050 4 _aQA76.63
072 7 _aUM
_2bicssc
072 7 _aUYF
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aCOM036000
_2bisacsh
082 0 4 _a005.1015113
_223
100 1 _aMogavero, Fabio.
_eauthor.
245 1 0 _aLogics in Computer Science
_h[electronic resource] :
_bA Study on Extensions of Temporal and Strategic Logics /
_cby Fabio Mogavero.
264 1 _aParis :
_bAtlantis Press :
_bImprint: Atlantis Press,
_c2013.
300 _aXVII, 149 p. 13 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aAtlantis Studies in Computing,
_x2212-8557 ;
_v3
505 0 _aGraded Computation Tree Logic -- Minimal Model Quantifiers -- Reasoning About Strategies -- Relentful Strategic Reasoning -- Appendix A Mathematical Notation.
520 _aIn 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 _aComputer science.
650 0 _aComputer software.
650 0 _aLogic design.
650 1 4 _aComputer Science.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9789491216947
830 0 _aAtlantis Studies in Computing,
_x2212-8557 ;
_v3
856 4 0 _uhttp://dx.doi.org/10.2991/978-94-91216-95-4
912 _aZDB-2-SMA
999 _c100157
_d100157