Modern applications of automata theory /:
Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To th...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Singapore ; Hackensack :
World Scientific,
©2012.
|
| Schriftenreihe: | IISc research monographs series ;
2. |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material not normally covered in a beginner's course in automata theory, and then rapidly moves on to applications. The book is largely devoted to verification and model checking, and contains material that is at the cutting edge of verification technology. It will be an invaluable reference for software practitioners working in this area. |
| Beschreibung: | Title from PDF title page (viewed 7/31/18). |
| Beschreibung: | 1 online resource (xvi, 656 pages) : illustrations |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9789814271059 9814271055 1283593564 9781283593564 9786613906014 6613906018 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn810931629 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 120924s2012 si a ob 000 0 eng d | ||
| 040 | |a N$T |b eng |e pn |c N$T |d IDEBK |d YDXCP |d E7B |d EBLCP |d OCLCQ |d CDX |d OCLCF |d OCLCA |d OCLCQ |d DEBSZ |d OCLCQ |d AGLDB |d VGM |d OCLCQ |d UAB |d OCLCQ |d VTS |d NAM |d STF |d AU@ |d UKAHL |d OL$ |d OCLCQ |d VLY |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL |d SXB |d OCLCQ |d OCLCO |d OCLCQ | ||
| 019 | |a 810317512 |a 817811943 |a 819613075 |a 1162012316 |a 1241883198 |a 1300694931 | ||
| 020 | |a 9789814271059 |q (electronic bk.) | ||
| 020 | |a 9814271055 |q (electronic bk.) | ||
| 020 | |a 1283593564 | ||
| 020 | |a 9781283593564 | ||
| 020 | |a 9786613906014 | ||
| 020 | |a 6613906018 | ||
| 020 | |z 9814271047 | ||
| 020 | |z 9789814271042 | ||
| 035 | |a (OCoLC)810931629 |z (OCoLC)810317512 |z (OCoLC)817811943 |z (OCoLC)819613075 |z (OCoLC)1162012316 |z (OCoLC)1241883198 |z (OCoLC)1300694931 | ||
| 050 | 4 | |a QA267 |b .M63 2012eb | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 072 | 7 | |a UY |2 bicssc | |
| 082 | 7 | |a 511.3 |2 23 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Modern applications of automata theory / |c editors, Deepak D'Souza, Priti Shankar. |
| 260 | |a Singapore ; |a Hackensack : |b World Scientific, |c ©2012. | ||
| 300 | |a 1 online resource (xvi, 656 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 490 | 1 | |a IISc research monographs series ; |v 2 | |
| 500 | |a Title from PDF title page (viewed 7/31/18). | ||
| 504 | |a Includes bibliographical references. | ||
| 520 | |a Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material not normally covered in a beginner's course in automata theory, and then rapidly moves on to applications. The book is largely devoted to verification and model checking, and contains material that is at the cutting edge of verification technology. It will be an invaluable reference for software practitioners working in this area. | ||
| 505 | 0 | |a pt. I. Basic chapters. 1. An introduction to finite automata and their connection to logic / Howard Straubing and Pascal Weil. 2. Finite-state automata on infinite inputs / Madhavan Mukund. 3. Basics on tree automata / Christof Loding. 4. An introduction to timed automata / Paritosh K. Pandya and P. Vijay Suman -- pt. II. Verification. 5. A language-theoretic view of verification / Kamal Lodaya. 6. A framework for decentralized physical access control using finite state automata / Namit Chaturvedi, Atish Datta Chowdhury and B. Meenakshi. 7. Reasoning about heap manipulating programs using automata techniques / Supratik Chakraborty. 8. Chop expressions and discrete duration calculus / S. Ajesh Babu and Paritosh K. Pandya. 9. Automata on distributed alphabets / Madhavan Mukund. 10. The theory of message sequence charts / K. Narayan Kumar. 11. Type checking of tree walking transducers / Sebastian Maneth, Sylvia Friese and Helmut Seidl. 12. Three case studies on verification of infinite-state systems / Javier Esparza and Jorg Kreiker. 13. Introduction to hybrid automata / Madhu Gopinathan and Pavithra Prabhakar. 14. The discrete time behavior of restricted linear hybrid automata / Manindra Agrawal [and others] -- pt. III. Automata and logic. 15. Specification and verification using temporal logics / Stephane Demri and Paul Gastin. 16. Finite automata and the analysis of infinite transition systems / Wolfgang Thomas. 17. Automata over infinite alpahabets / Amaldev Manuel and R. Ramanujam. 18. Automata and logics over signals / Fabrice Chevalier [and others] -- pt. IV. Compression. 19. Syntax directed compression of trees using pushdown automata / Priti Shankar. 20. Weighted finite automata and digital images / Kamala Krithivasan and Y. Sivasubramanyam. | |
| 546 | |a English. | ||
| 650 | 0 | |a Machine theory. |0 http://id.loc.gov/authorities/subjects/sh85079341 | |
| 650 | 0 | |a Computational complexity. |0 http://id.loc.gov/authorities/subjects/sh85029473 | |
| 650 | 6 | |a Théorie des automates. | |
| 650 | 6 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 700 | 1 | |a D'Souza, Deepak. |1 https://id.oclc.org/worldcat/entity/E39PCjJf7FHBgBC97dfBbbXfMP |0 http://id.loc.gov/authorities/names/no2012126758 | |
| 700 | 1 | |a Shankar, P. |q (Priti) |1 https://id.oclc.org/worldcat/entity/E39PBJymtRVd3dDtdkR8c34g8C |0 http://id.loc.gov/authorities/names/n2002010631 | |
| 776 | 0 | 8 | |i Print version: |t Modern applications of automata theory. |d Singapore : World Scientific, ©2012 |z 9814271047 |w (OCoLC)800476142 |
| 830 | 0 | |a IISc research monographs series ; |v 2. |0 http://id.loc.gov/authorities/names/no2009096980 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=478648 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH24256222 | ||
| 938 | |a Coutts Information Services |b COUT |n 24020437 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1019617 | ||
| 938 | |a ebrary |b EBRY |n ebr10596928 | ||
| 938 | |a EBSCOhost |b EBSC |n 478648 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n 390601 | ||
| 938 | |a YBP Library Services |b YANK |n 6989172 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn810931629 |
|---|---|
| _version_ | 1816882207533301760 |
| adam_text | |
| any_adam_object | |
| author2 | D'Souza, Deepak Shankar, P. (Priti) |
| author2_role | |
| author2_variant | d d dd p s ps |
| author_GND | http://id.loc.gov/authorities/names/no2012126758 http://id.loc.gov/authorities/names/n2002010631 |
| author_facet | D'Souza, Deepak Shankar, P. (Priti) |
| author_sort | D'Souza, Deepak |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267 .M63 2012eb |
| callnumber-search | QA267 .M63 2012eb |
| callnumber-sort | QA 3267 M63 42012EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | pt. I. Basic chapters. 1. An introduction to finite automata and their connection to logic / Howard Straubing and Pascal Weil. 2. Finite-state automata on infinite inputs / Madhavan Mukund. 3. Basics on tree automata / Christof Loding. 4. An introduction to timed automata / Paritosh K. Pandya and P. Vijay Suman -- pt. II. Verification. 5. A language-theoretic view of verification / Kamal Lodaya. 6. A framework for decentralized physical access control using finite state automata / Namit Chaturvedi, Atish Datta Chowdhury and B. Meenakshi. 7. Reasoning about heap manipulating programs using automata techniques / Supratik Chakraborty. 8. Chop expressions and discrete duration calculus / S. Ajesh Babu and Paritosh K. Pandya. 9. Automata on distributed alphabets / Madhavan Mukund. 10. The theory of message sequence charts / K. Narayan Kumar. 11. Type checking of tree walking transducers / Sebastian Maneth, Sylvia Friese and Helmut Seidl. 12. Three case studies on verification of infinite-state systems / Javier Esparza and Jorg Kreiker. 13. Introduction to hybrid automata / Madhu Gopinathan and Pavithra Prabhakar. 14. The discrete time behavior of restricted linear hybrid automata / Manindra Agrawal [and others] -- pt. III. Automata and logic. 15. Specification and verification using temporal logics / Stephane Demri and Paul Gastin. 16. Finite automata and the analysis of infinite transition systems / Wolfgang Thomas. 17. Automata over infinite alpahabets / Amaldev Manuel and R. Ramanujam. 18. Automata and logics over signals / Fabrice Chevalier [and others] -- pt. IV. Compression. 19. Syntax directed compression of trees using pushdown automata / Priti Shankar. 20. Weighted finite automata and digital images / Kamala Krithivasan and Y. Sivasubramanyam. |
| ctrlnum | (OCoLC)810931629 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05929cam a2200697 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn810931629</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">120924s2012 si a ob 000 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">IDEBK</subfield><subfield code="d">YDXCP</subfield><subfield code="d">E7B</subfield><subfield code="d">EBLCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">CDX</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCA</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AGLDB</subfield><subfield code="d">VGM</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UAB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">NAM</subfield><subfield code="d">STF</subfield><subfield code="d">AU@</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OL$</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VLY</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield><subfield code="d">SXB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">810317512</subfield><subfield code="a">817811943</subfield><subfield code="a">819613075</subfield><subfield code="a">1162012316</subfield><subfield code="a">1241883198</subfield><subfield code="a">1300694931</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9789814271059</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9814271055</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1283593564</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781283593564</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9786613906014</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">6613906018</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9814271047</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9789814271042</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)810931629</subfield><subfield code="z">(OCoLC)810317512</subfield><subfield code="z">(OCoLC)817811943</subfield><subfield code="z">(OCoLC)819613075</subfield><subfield code="z">(OCoLC)1162012316</subfield><subfield code="z">(OCoLC)1241883198</subfield><subfield code="z">(OCoLC)1300694931</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267</subfield><subfield code="b">.M63 2012eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">016000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">UY</subfield><subfield code="2">bicssc</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Modern applications of automata theory /</subfield><subfield code="c">editors, Deepak D'Souza, Priti Shankar.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Singapore ;</subfield><subfield code="a">Hackensack :</subfield><subfield code="b">World Scientific,</subfield><subfield code="c">©2012.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xvi, 656 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">IISc research monographs series ;</subfield><subfield code="v">2</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from PDF title page (viewed 7/31/18).</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material not normally covered in a beginner's course in automata theory, and then rapidly moves on to applications. The book is largely devoted to verification and model checking, and contains material that is at the cutting edge of verification technology. It will be an invaluable reference for software practitioners working in this area.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">pt. I. Basic chapters. 1. An introduction to finite automata and their connection to logic / Howard Straubing and Pascal Weil. 2. Finite-state automata on infinite inputs / Madhavan Mukund. 3. Basics on tree automata / Christof Loding. 4. An introduction to timed automata / Paritosh K. Pandya and P. Vijay Suman -- pt. II. Verification. 5. A language-theoretic view of verification / Kamal Lodaya. 6. A framework for decentralized physical access control using finite state automata / Namit Chaturvedi, Atish Datta Chowdhury and B. Meenakshi. 7. Reasoning about heap manipulating programs using automata techniques / Supratik Chakraborty. 8. Chop expressions and discrete duration calculus / S. Ajesh Babu and Paritosh K. Pandya. 9. Automata on distributed alphabets / Madhavan Mukund. 10. The theory of message sequence charts / K. Narayan Kumar. 11. Type checking of tree walking transducers / Sebastian Maneth, Sylvia Friese and Helmut Seidl. 12. Three case studies on verification of infinite-state systems / Javier Esparza and Jorg Kreiker. 13. Introduction to hybrid automata / Madhu Gopinathan and Pavithra Prabhakar. 14. The discrete time behavior of restricted linear hybrid automata / Manindra Agrawal [and others] -- pt. III. Automata and logic. 15. Specification and verification using temporal logics / Stephane Demri and Paul Gastin. 16. Finite automata and the analysis of infinite transition systems / Wolfgang Thomas. 17. Automata over infinite alpahabets / Amaldev Manuel and R. Ramanujam. 18. Automata and logics over signals / Fabrice Chevalier [and others] -- pt. IV. Compression. 19. Syntax directed compression of trees using pushdown automata / Priti Shankar. 20. Weighted finite automata and digital images / Kamala Krithivasan and Y. Sivasubramanyam.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85079341</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85029473</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des automates.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Infinity.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Logic.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">D'Souza, Deepak.</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjJf7FHBgBC97dfBbbXfMP</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2012126758</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shankar, P.</subfield><subfield code="q">(Priti)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJymtRVd3dDtdkR8c34g8C</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2002010631</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Modern applications of automata theory.</subfield><subfield code="d">Singapore : World Scientific, ©2012</subfield><subfield code="z">9814271047</subfield><subfield code="w">(OCoLC)800476142</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">IISc research monographs series ;</subfield><subfield code="v">2.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2009096980</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=478648</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH24256222</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">24020437</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1019617</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10596928</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">478648</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">390601</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6989172</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn810931629 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:24:57Z |
| institution | BVB |
| isbn | 9789814271059 9814271055 1283593564 9781283593564 9786613906014 6613906018 |
| language | English |
| oclc_num | 810931629 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xvi, 656 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2012 |
| publishDateSearch | 2012 |
| publishDateSort | 2012 |
| publisher | World Scientific, |
| record_format | marc |
| series | IISc research monographs series ; |
| series2 | IISc research monographs series ; |
| spelling | Modern applications of automata theory / editors, Deepak D'Souza, Priti Shankar. Singapore ; Hackensack : World Scientific, ©2012. 1 online resource (xvi, 656 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier IISc research monographs series ; 2 Title from PDF title page (viewed 7/31/18). Includes bibliographical references. Automata theory has come into prominence in recent years with a plethora of applications in fields ranging from verification to XML processing and file compression. In fact, the 2007 Turing Award was awarded to Clarke, Emerson and Sifakis for their pioneering work on model-checking techniques. To the best of our knowledge, there is no single book that covers the vast range of applications of automata theory targeted at a mature student audience. This book is intended to fill that gap and can be used as an intermediate-level textbook. It begins with a detailed treatment of foundational material not normally covered in a beginner's course in automata theory, and then rapidly moves on to applications. The book is largely devoted to verification and model checking, and contains material that is at the cutting edge of verification technology. It will be an invaluable reference for software practitioners working in this area. pt. I. Basic chapters. 1. An introduction to finite automata and their connection to logic / Howard Straubing and Pascal Weil. 2. Finite-state automata on infinite inputs / Madhavan Mukund. 3. Basics on tree automata / Christof Loding. 4. An introduction to timed automata / Paritosh K. Pandya and P. Vijay Suman -- pt. II. Verification. 5. A language-theoretic view of verification / Kamal Lodaya. 6. A framework for decentralized physical access control using finite state automata / Namit Chaturvedi, Atish Datta Chowdhury and B. Meenakshi. 7. Reasoning about heap manipulating programs using automata techniques / Supratik Chakraborty. 8. Chop expressions and discrete duration calculus / S. Ajesh Babu and Paritosh K. Pandya. 9. Automata on distributed alphabets / Madhavan Mukund. 10. The theory of message sequence charts / K. Narayan Kumar. 11. Type checking of tree walking transducers / Sebastian Maneth, Sylvia Friese and Helmut Seidl. 12. Three case studies on verification of infinite-state systems / Javier Esparza and Jorg Kreiker. 13. Introduction to hybrid automata / Madhu Gopinathan and Pavithra Prabhakar. 14. The discrete time behavior of restricted linear hybrid automata / Manindra Agrawal [and others] -- pt. III. Automata and logic. 15. Specification and verification using temporal logics / Stephane Demri and Paul Gastin. 16. Finite automata and the analysis of infinite transition systems / Wolfgang Thomas. 17. Automata over infinite alpahabets / Amaldev Manuel and R. Ramanujam. 18. Automata and logics over signals / Fabrice Chevalier [and others] -- pt. IV. Compression. 19. Syntax directed compression of trees using pushdown automata / Priti Shankar. 20. Weighted finite automata and digital images / Kamala Krithivasan and Y. Sivasubramanyam. English. Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Théorie des automates. Complexité de calcul (Informatique) MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Computational complexity fast Machine theory fast D'Souza, Deepak. https://id.oclc.org/worldcat/entity/E39PCjJf7FHBgBC97dfBbbXfMP http://id.loc.gov/authorities/names/no2012126758 Shankar, P. (Priti) https://id.oclc.org/worldcat/entity/E39PBJymtRVd3dDtdkR8c34g8C http://id.loc.gov/authorities/names/n2002010631 Print version: Modern applications of automata theory. Singapore : World Scientific, ©2012 9814271047 (OCoLC)800476142 IISc research monographs series ; 2. http://id.loc.gov/authorities/names/no2009096980 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=478648 Volltext |
| spellingShingle | Modern applications of automata theory / IISc research monographs series ; pt. I. Basic chapters. 1. An introduction to finite automata and their connection to logic / Howard Straubing and Pascal Weil. 2. Finite-state automata on infinite inputs / Madhavan Mukund. 3. Basics on tree automata / Christof Loding. 4. An introduction to timed automata / Paritosh K. Pandya and P. Vijay Suman -- pt. II. Verification. 5. A language-theoretic view of verification / Kamal Lodaya. 6. A framework for decentralized physical access control using finite state automata / Namit Chaturvedi, Atish Datta Chowdhury and B. Meenakshi. 7. Reasoning about heap manipulating programs using automata techniques / Supratik Chakraborty. 8. Chop expressions and discrete duration calculus / S. Ajesh Babu and Paritosh K. Pandya. 9. Automata on distributed alphabets / Madhavan Mukund. 10. The theory of message sequence charts / K. Narayan Kumar. 11. Type checking of tree walking transducers / Sebastian Maneth, Sylvia Friese and Helmut Seidl. 12. Three case studies on verification of infinite-state systems / Javier Esparza and Jorg Kreiker. 13. Introduction to hybrid automata / Madhu Gopinathan and Pavithra Prabhakar. 14. The discrete time behavior of restricted linear hybrid automata / Manindra Agrawal [and others] -- pt. III. Automata and logic. 15. Specification and verification using temporal logics / Stephane Demri and Paul Gastin. 16. Finite automata and the analysis of infinite transition systems / Wolfgang Thomas. 17. Automata over infinite alpahabets / Amaldev Manuel and R. Ramanujam. 18. Automata and logics over signals / Fabrice Chevalier [and others] -- pt. IV. Compression. 19. Syntax directed compression of trees using pushdown automata / Priti Shankar. 20. Weighted finite automata and digital images / Kamala Krithivasan and Y. Sivasubramanyam. Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Théorie des automates. Complexité de calcul (Informatique) MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Computational complexity fast Machine theory fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85079341 http://id.loc.gov/authorities/subjects/sh85029473 |
| title | Modern applications of automata theory / |
| title_auth | Modern applications of automata theory / |
| title_exact_search | Modern applications of automata theory / |
| title_full | Modern applications of automata theory / editors, Deepak D'Souza, Priti Shankar. |
| title_fullStr | Modern applications of automata theory / editors, Deepak D'Souza, Priti Shankar. |
| title_full_unstemmed | Modern applications of automata theory / editors, Deepak D'Souza, Priti Shankar. |
| title_short | Modern applications of automata theory / |
| title_sort | modern applications of automata theory |
| topic | Machine theory. http://id.loc.gov/authorities/subjects/sh85079341 Computational complexity. http://id.loc.gov/authorities/subjects/sh85029473 Théorie des automates. Complexité de calcul (Informatique) MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Computational complexity fast Machine theory fast |
| topic_facet | Machine theory. Computational complexity. Théorie des automates. Complexité de calcul (Informatique) MATHEMATICS Infinity. MATHEMATICS Logic. Computational complexity Machine theory |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=478648 |
| work_keys_str_mv | AT dsouzadeepak modernapplicationsofautomatatheory AT shankarp modernapplicationsofautomatatheory |