Temporal logics in computer science: finite-state systems
This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most i...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge
Cambridge University Press
[2016]
|
| Series: | Cambridge tracts in theoretical computer science
58 |
| Subjects: | |
| Summary: | This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses |
| Physical Description: | viii, 744 Seiten Illustrationen |
| ISBN: | 9781107028364 |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV043949894 | ||
| 003 | DE-604 | ||
| 005 | 20180424 | ||
| 007 | t | ||
| 008 | 161207s2016 a||| |||| 00||| eng d | ||
| 020 | |a 9781107028364 |c Print |9 978-1-107-02836-4 | ||
| 035 | |a (OCoLC)965631558 | ||
| 035 | |a (DE-599)BVBBV043949894 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-703 |a DE-83 | ||
| 082 | 0 | |a 001.642 |2 23 | |
| 084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
| 084 | |a 68Q85 |2 msc | ||
| 084 | |a 03B44 |2 msc | ||
| 084 | |a 68-02 |2 msc | ||
| 084 | |a 68Q60 |2 msc | ||
| 100 | 1 | |a Demri, Stéphane |d 1967- |0 (DE-588)1089670281 |4 aut | |
| 245 | 1 | 0 | |a Temporal logics in computer science |b finite-state systems |c Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), France ; Valentin Goranko, Stockholms Universitet ; Martin Lange, Universität Kassel, Germany |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c [2016] | |
| 264 | 4 | |c © 2016 | |
| 300 | |a viii, 744 Seiten |b Illustrationen | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cambridge tracts in theoretical computer science |v 58 | |
| 520 | |a This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses | ||
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Temporale Logik |0 (DE-588)4137542-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Temporale Logik |0 (DE-588)4137542-7 |D s |
| 689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Goranko, Valentin |0 (DE-588)1073308766 |4 aut | |
| 700 | 1 | |a Lange, Martin |d 1974- |0 (DE-588)101151799X |4 aut | |
| 830 | 0 | |a Cambridge tracts in theoretical computer science |v 58 |w (DE-604)BV000754528 |9 58 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029358775 | ||
Record in the Search Index
| _version_ | 1804176899397648384 |
|---|---|
| any_adam_object | |
| author | Demri, Stéphane 1967- Goranko, Valentin Lange, Martin 1974- |
| author_GND | (DE-588)1089670281 (DE-588)1073308766 (DE-588)101151799X |
| author_facet | Demri, Stéphane 1967- Goranko, Valentin Lange, Martin 1974- |
| author_role | aut aut aut |
| author_sort | Demri, Stéphane 1967- |
| author_variant | s d sd v g vg m l ml |
| building | Verbundindex |
| bvnumber | BV043949894 |
| classification_rvk | ST 125 |
| ctrlnum | (OCoLC)965631558 (DE-599)BVBBV043949894 |
| dewey-full | 001.642 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 001 - Knowledge |
| dewey-raw | 001.642 |
| dewey-search | 001.642 |
| dewey-sort | 11.642 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Allgemeines Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02681nam a2200481 cb4500</leader><controlfield tag="001">BV043949894</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20180424 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">161207s2016 a||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781107028364</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-107-02836-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)965631558</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043949894</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">001.642</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 125</subfield><subfield code="0">(DE-625)143586:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q85</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">03B44</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68-02</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q60</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Demri, Stéphane</subfield><subfield code="d">1967-</subfield><subfield code="0">(DE-588)1089670281</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Temporal logics in computer science</subfield><subfield code="b">finite-state systems</subfield><subfield code="c">Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), France ; Valentin Goranko, Stockholms Universitet ; Martin Lange, Universität Kassel, Germany</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2016</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">viii, 744 Seiten</subfield><subfield code="b">Illustrationen</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">58</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Temporale Logik</subfield><subfield code="0">(DE-588)4137542-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Temporale Logik</subfield><subfield code="0">(DE-588)4137542-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goranko, Valentin</subfield><subfield code="0">(DE-588)1073308766</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lange, Martin</subfield><subfield code="d">1974-</subfield><subfield code="0">(DE-588)101151799X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">58</subfield><subfield code="w">(DE-604)BV000754528</subfield><subfield code="9">58</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029358775</subfield></datafield></record></collection> |
| id | DE-604.BV043949894 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T07:39:31Z |
| institution | BVB |
| isbn | 9781107028364 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029358775 |
| oclc_num | 965631558 |
| open_access_boolean | |
| owner | DE-703 DE-83 |
| owner_facet | DE-703 DE-83 |
| physical | viii, 744 Seiten Illustrationen |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Cambridge University Press |
| record_format | marc |
| series | Cambridge tracts in theoretical computer science |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Demri, Stéphane 1967- (DE-588)1089670281 aut Temporal logics in computer science finite-state systems Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), France ; Valentin Goranko, Stockholms Universitet ; Martin Lange, Universität Kassel, Germany Cambridge Cambridge University Press [2016] © 2016 viii, 744 Seiten Illustrationen txt rdacontent n rdamedia nc rdacarrier Cambridge tracts in theoretical computer science 58 This comprehensive text provides a modern and technically precise exposition of the fundamental theory and applications of temporal logics in computer science. Part I presents the basics of discrete transition systems, including constructions and behavioural equivalences. Part II examines the most important temporal logics for transition systems and Part III looks at their expressiveness and complexity. Finally, Part IV describes the main computational methods and decision procedures for model checking and model building - based on tableaux, automata and games - and discusses their relationships. The book contains a wealth of examples and exercises, as well as an extensive annotated bibliography. Thus, the book is not only a solid professional reference for researchers in the field but also a comprehensive graduate textbook that can be used for self-study as well as for teaching courses Computer programming Logic, Symbolic and mathematical Informatik (DE-588)4026894-9 gnd rswk-swf Temporale Logik (DE-588)4137542-7 gnd rswk-swf Temporale Logik (DE-588)4137542-7 s Informatik (DE-588)4026894-9 s DE-604 Goranko, Valentin (DE-588)1073308766 aut Lange, Martin 1974- (DE-588)101151799X aut Cambridge tracts in theoretical computer science 58 (DE-604)BV000754528 58 |
| spellingShingle | Demri, Stéphane 1967- Goranko, Valentin Lange, Martin 1974- Temporal logics in computer science finite-state systems Cambridge tracts in theoretical computer science Computer programming Logic, Symbolic and mathematical Informatik (DE-588)4026894-9 gnd Temporale Logik (DE-588)4137542-7 gnd |
| subject_GND | (DE-588)4026894-9 (DE-588)4137542-7 |
| title | Temporal logics in computer science finite-state systems |
| title_auth | Temporal logics in computer science finite-state systems |
| title_exact_search | Temporal logics in computer science finite-state systems |
| title_full | Temporal logics in computer science finite-state systems Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), France ; Valentin Goranko, Stockholms Universitet ; Martin Lange, Universität Kassel, Germany |
| title_fullStr | Temporal logics in computer science finite-state systems Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), France ; Valentin Goranko, Stockholms Universitet ; Martin Lange, Universität Kassel, Germany |
| title_full_unstemmed | Temporal logics in computer science finite-state systems Stéphane Demri, Centre National de la Recherche Scientifique (CNRS), France ; Valentin Goranko, Stockholms Universitet ; Martin Lange, Universität Kassel, Germany |
| title_short | Temporal logics in computer science |
| title_sort | temporal logics in computer science finite state systems |
| title_sub | finite-state systems |
| topic | Computer programming Logic, Symbolic and mathematical Informatik (DE-588)4026894-9 gnd Temporale Logik (DE-588)4137542-7 gnd |
| topic_facet | Computer programming Logic, Symbolic and mathematical Informatik Temporale Logik |
| volume_link | (DE-604)BV000754528 |
| work_keys_str_mv | AT demristephane temporallogicsincomputersciencefinitestatesystems AT gorankovalentin temporallogicsincomputersciencefinitestatesystems AT langemartin temporallogicsincomputersciencefinitestatesystems |