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...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Weitere beteiligte Personen: | , |
| Format: | E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2016
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
58 |
| Links: | https://doi.org/10.1017/CBO9781139236119 |
| Zusammenfassung: | 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. |
| Umfang: | 1 Online-Ressource (viii, 744 Seiten) |
| ISBN: | 9781139236119 |
Internformat
MARC
| LEADER | 00000nam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-20-CTM-CR9781139236119 | ||
| 003 | UkCbUP | ||
| 005 | 20200325094737.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 120125s2016||||enk o ||1 0|eng|d | ||
| 020 | |a 9781139236119 | ||
| 100 | 1 | |a Demri, Stéphane P. |d 1967- | |
| 245 | 1 | 0 | |a Temporal logics in computer science |b finite-state systems |c Stéphane Demri, Valentin Goranko, Martin Lange |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2016 | |
| 300 | |a 1 Online-Ressource (viii, 744 Seiten) | ||
| 336 | |b txt | ||
| 337 | |b c | ||
| 338 | |b cr | ||
| 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. | ||
| 700 | 1 | |a Goranko, Valentin | |
| 700 | 1 | |a Lange, Martin | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781107028364 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-20-CTM |q TUM_PDA_CTM |u https://doi.org/10.1017/CBO9781139236119 |3 Volltext |
| 912 | |a ZDB-20-CTM | ||
| 912 | |a ZDB-20-CTM | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-20-CTM-CR9781139236119 |
|---|---|
| _version_ | 1821494620840787968 |
| adam_text | |
| any_adam_object | |
| author | Demri, Stéphane P. 1967- |
| author2 | Goranko, Valentin Lange, Martin |
| author2_role | |
| author2_variant | v g vg m l ml |
| author_facet | Demri, Stéphane P. 1967- Goranko, Valentin Lange, Martin |
| author_role | |
| author_sort | Demri, Stéphane P. 1967- |
| author_variant | s p d sp spd |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-20-CTM |
| format | eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01781nam a2200277 i 4500</leader><controlfield tag="001">ZDB-20-CTM-CR9781139236119</controlfield><controlfield tag="003">UkCbUP</controlfield><controlfield tag="005">20200325094737.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr||||||||||||</controlfield><controlfield tag="008">120125s2016||||enk o ||1 0|eng|d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139236119</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Demri, Stéphane P.</subfield><subfield code="d">1967-</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, Valentin Goranko, Martin Lange</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="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (viii, 744 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</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="700" ind1="1" ind2=" "><subfield code="a">Goranko, Valentin</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lange, Martin</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781107028364</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-20-CTM</subfield><subfield code="q">TUM_PDA_CTM</subfield><subfield code="u">https://doi.org/10.1017/CBO9781139236119</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CTM</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-20-CTM-CR9781139236119 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-17T11:17:17Z |
| institution | BVB |
| isbn | 9781139236119 |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (viii, 744 Seiten) |
| psigel | ZDB-20-CTM TUM_PDA_CTM ZDB-20-CTM |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Demri, Stéphane P. 1967- Temporal logics in computer science finite-state systems Stéphane Demri, Valentin Goranko, Martin Lange Cambridge Cambridge University Press 2016 1 Online-Ressource (viii, 744 Seiten) txt c cr 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. Goranko, Valentin Lange, Martin Erscheint auch als Druck-Ausgabe 9781107028364 |
| spellingShingle | Demri, Stéphane P. 1967- Temporal logics in computer science finite-state systems |
| 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, Valentin Goranko, Martin Lange |
| title_fullStr | Temporal logics in computer science finite-state systems Stéphane Demri, Valentin Goranko, Martin Lange |
| title_full_unstemmed | Temporal logics in computer science finite-state systems Stéphane Demri, Valentin Goranko, Martin Lange |
| title_short | Temporal logics in computer science |
| title_sort | temporal logics in computer science finite state systems |
| title_sub | finite-state systems |
| work_keys_str_mv | AT demristephanep temporallogicsincomputersciencefinitestatesystems AT gorankovalentin temporallogicsincomputersciencefinitestatesystems AT langemartin temporallogicsincomputersciencefinitestatesystems |