83,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
Melden Sie sich
hier
hier
für den Produktalarm an, um über die Verfügbarkeit des Produkts informiert zu werden.
- Gebundenes Buch
"The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"--
Andere Kunden interessierten sich auch für
- Thomas H. CormenIntroduction to Algorithms123,99 €
- Randall HydeThe Art of 64-Bit Assembly, Volume 161,99 €
- Daniel ZingaroAlgorithmic Thinking30,99 €
- John D. KelleherFundamentals of Machine Learning for Predictive Data Analytics67,99 €
- Jon SteinhartThe Secret Life of Programs29,99 €
- Noam NisanThe Elements of Computing Systems46,80 €
- Daniel P. FriedmanThe Little Learner45,99 €
-
-
-
"The book presents automata theory from a fresh viewpoint inspired by its main modern application: program verification"--
Produktdetails
- Produktdetails
- Verlag: MIT Press Ltd
- Seitenzahl: 560
- Erscheinungstermin: 17. Oktober 2023
- Englisch
- Abmessung: 236mm x 185mm x 40mm
- Gewicht: 1186g
- ISBN-13: 9780262048637
- ISBN-10: 0262048639
- Artikelnr.: 68272707
- Verlag: MIT Press Ltd
- Seitenzahl: 560
- Erscheinungstermin: 17. Oktober 2023
- Englisch
- Abmessung: 236mm x 185mm x 40mm
- Gewicht: 1186g
- ISBN-13: 9780262048637
- ISBN-10: 0262048639
- Artikelnr.: 68272707
Javier Esparza is Professor and Chair of Foundations of Software Reliability and Theoretical Computer Science at the Technical University of Munich and coauthor of Free Choice Petri Nets and Unfoldings: A Partial-Order Approach to Model Checking. Michael Blondin is Associate Professor of Computer Science at the Université de Sherbrooke.
Preface xiii
0 Overview 1
I Automata on Finite Words
1 Automata Classes and Conversions 9
2 Minimization and Reduction 49
3 Operations on Sets: Implementations 75
4 Application 1: Pattern Matching 101
5 Operations on Relations: Implementations 113
6 Finite Universes and Decision Diagrams 131
7 Application II: Verification 163
8 Automata and Logic 193
9 Application III: Presburger Arithmetic 229
II Automata on Infinite Words
10 Classes of Automata and Conversions 247
11 Boolean Operations: Implementations 289
12 Emptiness Check: Implementations 313
13 Application I: Verification and Temporal Logic 341
14 Application II: MSO Logics on Words and Linear Arithmetic 365
Solutions 377
Bibliographic Notes 523
Bibliography 531
Index 539
0 Overview 1
I Automata on Finite Words
1 Automata Classes and Conversions 9
2 Minimization and Reduction 49
3 Operations on Sets: Implementations 75
4 Application 1: Pattern Matching 101
5 Operations on Relations: Implementations 113
6 Finite Universes and Decision Diagrams 131
7 Application II: Verification 163
8 Automata and Logic 193
9 Application III: Presburger Arithmetic 229
II Automata on Infinite Words
10 Classes of Automata and Conversions 247
11 Boolean Operations: Implementations 289
12 Emptiness Check: Implementations 313
13 Application I: Verification and Temporal Logic 341
14 Application II: MSO Logics on Words and Linear Arithmetic 365
Solutions 377
Bibliographic Notes 523
Bibliography 531
Index 539
Preface xiii
0 Overview 1
I Automata on Finite Words
1 Automata Classes and Conversions 9
2 Minimization and Reduction 49
3 Operations on Sets: Implementations 75
4 Application 1: Pattern Matching 101
5 Operations on Relations: Implementations 113
6 Finite Universes and Decision Diagrams 131
7 Application II: Verification 163
8 Automata and Logic 193
9 Application III: Presburger Arithmetic 229
II Automata on Infinite Words
10 Classes of Automata and Conversions 247
11 Boolean Operations: Implementations 289
12 Emptiness Check: Implementations 313
13 Application I: Verification and Temporal Logic 341
14 Application II: MSO Logics on Words and Linear Arithmetic 365
Solutions 377
Bibliographic Notes 523
Bibliography 531
Index 539
0 Overview 1
I Automata on Finite Words
1 Automata Classes and Conversions 9
2 Minimization and Reduction 49
3 Operations on Sets: Implementations 75
4 Application 1: Pattern Matching 101
5 Operations on Relations: Implementations 113
6 Finite Universes and Decision Diagrams 131
7 Application II: Verification 163
8 Automata and Logic 193
9 Application III: Presburger Arithmetic 229
II Automata on Infinite Words
10 Classes of Automata and Conversions 247
11 Boolean Operations: Implementations 289
12 Emptiness Check: Implementations 313
13 Application I: Verification and Temporal Logic 341
14 Application II: MSO Logics on Words and Linear Arithmetic 365
Solutions 377
Bibliographic Notes 523
Bibliography 531
Index 539