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:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2016
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
58 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| 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 |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 27 Oct 2016) |
| Beschreibung: | 1 online resource (viii, 744 pages) |
| ISBN: | 9781139236119 |
| DOI: | 10.1017/CBO9781139236119 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043940055 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2016 |||| o||u| ||||||eng d | ||
| 020 | |a 9781139236119 |c Online |9 978-1-139-23611-9 | ||
| 024 | 7 | |a 10.1017/CBO9781139236119 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781139236119 | ||
| 035 | |a (OCoLC)967678524 | ||
| 035 | |a (DE-599)BVBBV043940055 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 001.642 |2 23 | |
| 084 | |a ST 125 |0 (DE-625)143586: |2 rvk | ||
| 100 | 1 | |a Demri, Stéphane P. |d 1967- |e Verfasser |4 aut | |
| 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 resource (viii, 744 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 58 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 27 Oct 2016) | ||
| 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 Temporale Logik |0 (DE-588)4137542-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |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 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Goranko, Valentin |e Sonstige |4 oth | |
| 700 | 1 | |a Lange, Martin |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-1-107-02836-4 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139236119 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029349026 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139236119 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139236119 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176880029401088 |
|---|---|
| any_adam_object | |
| author | Demri, Stéphane P. 1967- |
| author_facet | Demri, Stéphane P. 1967- |
| author_role | aut |
| author_sort | Demri, Stéphane P. 1967- |
| author_variant | s p d sp spd |
| building | Verbundindex |
| bvnumber | BV043940055 |
| classification_rvk | ST 125 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781139236119 (OCoLC)967678524 (DE-599)BVBBV043940055 |
| 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 |
| doi_str_mv | 10.1017/CBO9781139236119 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02998nmm a2200517zcb4500</leader><controlfield tag="001">BV043940055</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139236119</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-23611-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139236119</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139236119</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967678524</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940055</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-12</subfield><subfield code="a">DE-92</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="100" ind1="1" ind2=" "><subfield code="a">Demri, Stéphane P.</subfield><subfield code="d">1967-</subfield><subfield code="e">Verfasser</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, 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 resource (viii, 744 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">58</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 27 Oct 2016)</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">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="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="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="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goranko, Valentin</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lange, Martin</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-1-107-02836-4</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139236119</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349026</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139236119</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139236119</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043940055 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:12Z |
| institution | BVB |
| isbn | 9781139236119 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349026 |
| oclc_num | 967678524 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (viii, 744 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| 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- Verfasser aut Temporal logics in computer science finite-state systems Stéphane Demri, Valentin Goranko, Martin Lange Cambridge Cambridge University Press 2016 1 online resource (viii, 744 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 58 Title from publisher's bibliographic system (viewed on 27 Oct 2016) 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 Temporale Logik (DE-588)4137542-7 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf Temporale Logik (DE-588)4137542-7 s Informatik (DE-588)4026894-9 s 1\p DE-604 Goranko, Valentin Sonstige oth Lange, Martin Sonstige oth Erscheint auch als Druckausgabe 978-1-107-02836-4 https://doi.org/10.1017/CBO9781139236119 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Demri, Stéphane P. 1967- Temporal logics in computer science finite-state systems Computer programming Logic, Symbolic and mathematical Temporale Logik (DE-588)4137542-7 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4137542-7 (DE-588)4026894-9 |
| 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 |
| topic | Computer programming Logic, Symbolic and mathematical Temporale Logik (DE-588)4137542-7 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Computer programming Logic, Symbolic and mathematical Temporale Logik Informatik |
| url | https://doi.org/10.1017/CBO9781139236119 |
| work_keys_str_mv | AT demristephanep temporallogicsincomputersciencefinitestatesystems AT gorankovalentin temporallogicsincomputersciencefinitestatesystems AT langemartin temporallogicsincomputersciencefinitestatesystems |