Atjaunināt sīkdatņu piekrišanu

Introduction to Embedded Systems: A Cyber-Physical Systems Approach Second Edition [Mīkstie vāki]

3.67/5 (14 ratings by Goodreads)
(University of California, Berkeley), (University of California At Berkeley)
  • Formāts: Paperback / softback, 568 pages, height x width x depth: 235x184x19 mm
  • Sērija : Introduction to Embedded Systems
  • Izdošanas datums: 30-Dec-2016
  • Izdevniecība: MIT Press
  • ISBN-10: 0262533812
  • ISBN-13: 9780262533812
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 61,22 €
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 568 pages, height x width x depth: 235x184x19 mm
  • Sērija : Introduction to Embedded Systems
  • Izdošanas datums: 30-Dec-2016
  • Izdevniecība: MIT Press
  • ISBN-10: 0262533812
  • ISBN-13: 9780262533812
Citas grāmatas par šo tēmu:

The most visible use of computers and software is processing information for human consumption. The vast majority of computers in use, however, are much less visible. They run the engine, brakes, seatbelts, airbag, and audio system in your car. They digitally encode your voice and construct a radio signal to send it from your cell phone to a base station. They command robots on a factory floor, power generation in a power plant, processes in a chemical plant, and traffic lights in a city. These less visible computers are called embedded systems, and the software they run is called embedded software. The principal challenges in designing and analyzing embedded systems stem from their interaction with physical processes. This book takes a cyber-physical approach to embedded systems, introducing the engineering concepts underlying embedded systems as a technology and as a subject of study. The focus is on modeling, design, and analysis of cyber-physical systems, which integrate computation, networking, and physical processes.

The second edition offers two new chapters, several new exercises, and other improvements. The book can be used as a textbook at the advanced undergraduate or introductory graduate level and as a professional reference for practicing engineers and computer scientists. Readers should have some familiarity with machine structures, computer programming, basic discrete mathematics and algorithms, and signals and systems.

Preface xiii
1 Introduction
1(16)
1.1 Applications
2(4)
1.2 Motivating Example
6(2)
1.3 The Design Process
8(7)
1.4 Summary
15(2)
I Modeling Dynamic Behaviors
17(152)
2 Continuous Dynamics
19(22)
2.1 Newtonian Mechanics
20(5)
2.2 Actor Models
25(3)
2.3 Properties of Systems
28(3)
2.4 Feedback Control
31(6)
2.5 Summary
37(4)
Exercises
37(4)
3 Discrete Dynamics
41(34)
3.1 Discrete Systems
42(4)
3.2 The Notion of State
46(1)
3.3 Finite-State Machines
47(9)
3.4 Extended State Machines
56(6)
3.5 Nondeterminism
62(4)
3.6 Behaviors and Traces
66(3)
3.7 Summary
69(6)
Exercises
70(5)
4 Hybrid Systems
75(28)
4.1 Modal Models
76(4)
4.2 Classes of Hybrid Systems
80(15)
4.3 Summary
95(8)
Exercises
96(7)
5 Composition of State Machines
103(26)
5.1 Concurrent Composition
105(14)
5.2 Hierarchical State Machines
119(4)
5.3 Summary
123(6)
Exercises
124(5)
6 Concurrent Models of Computation
129(40)
6.1 Structure of Models
130(2)
6.2 Synchronous-Reactive Models
132(10)
6.3 Dataflow Models of Computation
142(12)
6.4 Timed Models of Computation
154(9)
6.5 Summary
163(6)
Exercises
163(6)
II Design of Embedded Systems
169(172)
7 Sensors and Actuators
171(30)
7.1 Models of Sensors and Actuators
173(13)
7.2 Common Sensors
186(5)
7.3 Actuators
191(5)
7.4 Summary
196(5)
Exercises
197(4)
8 Embedded Processors
201(28)
8.1 Types of Processors
202(10)
8.2 Parallelism
212(15)
8.3 Summary
227(2)
Exercises
227(2)
9 Memory Architectures
229(20)
9.1 Memory Technologies
230(2)
9.2 Memory Hierarchy
232(8)
9.3 Memory Models
240(5)
9.4 Summary
245(4)
Exercises
245(4)
10 Input and Output
249(30)
10.1 I/O Hardware
250(11)
10.2 Sequential Software in a Concurrent World
261(10)
10.3 Summary
271(8)
Exercises
272(7)
11 Multitasking
279(30)
11.1 Imperative Programs
282(4)
11.2 Threads
286(12)
11.3 Processes and Message Passing
298(5)
11.4 Summary
303(6)
Exercises
304(5)
12 Scheduling
309(32)
12.1 Basics of Scheduling
310(6)
12.2 Rate Monotonic Scheduling
316(4)
12.3 Earliest Deadline First
320(5)
12.4 Scheduling and Mutual Exclusion
325(4)
12.5 Multiprocessor Scheduling
329(6)
12.6 Summary
335(6)
Exercises
335(6)
III Analysis and Verification
341(128)
13 Invariants and Temporal Logic
343(16)
13.1 Invariants
344(2)
13.2 Linear Temporal Logic
346(8)
13.3 Summary
354(5)
Exercises
356(3)
14 Equivalence and Refinement
359(26)
14.1 Models as Specifications
360(1)
14.2 Type Equivalence and Refinement
361(3)
14.3 Language Equivalence and Containment
364(6)
14.4 Simulation
370(7)
14.5 Bisimulation
377(2)
14.6 Summary
379(6)
Exercises
380(5)
15 Reachability Analysis and Model Checking
385(22)
15.1 Open and Closed Systems
386(1)
15.2 Reachability Analysis
387(7)
15.3 Abstraction in Model Checking
394(3)
15.4 Model Checking Liveness Properties
397(6)
15.5 Summary
403(4)
Exercises
405(2)
16 Quantitative Analysis
407(30)
16.1 Problems of Interest
408(2)
16.2 Programs as Graphs
410(5)
16.3 Factors Determining Execution Time
415(6)
16.4 Basics of Execution Time Analysis
421(10)
16.5 Other Quantitative Analysis Problems
431(1)
16.6 Summary
432(5)
Exercises
433(4)
17 Security and Privacy
437(32)
17.1 Cryptographic Primitives
439(7)
17.2 Protocol and Network Security
446(5)
17.3 Software Security
451(3)
17.4 Information Flow
454(8)
17.5 Advanced Topics
462(5)
17.6 Summary
467(2)
Exercises
467(2)
IV Appendices
469(2)
A Sets and Functions
471(8)
A.1 Sets
471(1)
A.2 Relations and Functions
472(4)
A.3 Sequences
476(3)
Exercises
478(1)
B Complexity and Computability
479(18)
B.1 Effectiveness and Complexity of Algorithms
480(3)
B.2 Problems, Algorithms, and Programs
483(2)
B.3 Turing Machines and Undecidability
485(6)
B.4 Intractability: P and NP
491(3)
B.5 Summary
494(3)
Exercises
494(3)
Bibliography 497(18)
Notation Index 515(2)
Index 517