000 12389cam a2200745 i 4500
001 ocn992437550
003 OCoLC
005 20220711203441.0
006 m o d
007 cr |||||||||||
008 170628s2017 nju ob 001 0 eng
010 _a 2017030269
040 _aDLC
_beng
_erda
_epn
_cDLC
_dN$T
_dDG1
_dIDEBK
_dOCLCF
_dUAB
_dUPM
_dOCLCO
_dOCLCQ
_dDEBSZ
_dCOO
_dK6U
_dLIV
_dOCLCQ
_dD6H
_dOCLCQ
_dKSU
_dRECBK
_dWYU
_dLVT
_dS9I
_dU3W
_dOCLCQ
019 _a1066604367
020 _a9781119420705
_q(pdf)
020 _a1119420709
_q(pdf)
020 _a9781119420682
_q(epub)
020 _a1119420687
_q(epub)
020 _a9781119420712
020 _a1119420717
020 _z9781118116173
_q(hardback)
020 _z1118116178
029 1 _aAU@
_b000060424887
029 1 _aCHBIS
_b011094855
029 1 _aCHNEW
_b000964897
029 1 _aCHVBK
_b495227625
029 1 _aCHVBK
_b503874914
029 1 _aDEBSZ
_b493821260
029 1 _aGBVCP
_b1014966566
035 _a(OCoLC)992437550
_z(OCoLC)1066604367
042 _apcc
050 0 0 _aTK7895.E42
072 7 _aCOM
_x000000
_2bisacsh
082 0 0 _a006.2/2
_223
084 _aTEC008070
_2bisacsh
049 _aMAIN
100 1 _aWang, Jiacun,
_d1963-
_eauthor.
_97791
245 1 0 _aReal-time embedded systems /
_cby Jiacun Wang.
264 1 _aHoboken, NJ, USA :
_bWiley,
_c2017.
300 _a1 online resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bn
_2rdamedia
338 _aonline resource
_bnc
_2rdacarrier
347 _adata file
_2rda
490 0 _aQuantitative software engineering series
520 _a"Offering comprehensive coverage of the convergence of real-time embedded systems scheduling, resource access control, software design and development, and high-level system modeling, analysis and verification; Following an introductory overview, Dr. Wang delves into the specifics of hardware components, including processors, memory, I/O devices and architectures, communication structures, peripherals, and characteristics of real-time operating systems. Later chapters are dedicated to real-time task scheduling algorithms and resource access control policies, as well as priority-inversion control and deadlock avoidance. Concurrent system programming and POSIX programming for real-time systems are covered, as are finite state machines and Time Petri nets. Of special interest to software engineers will be the chapter devoted to model checking, in which the author discusses temporal logic and the NuSMV model checking tool, as well as a chapter treating real-time software design with UML. The final portion of the book explores practical issues of software reliability, aging, rejuvenation, security, safety, and power management. In addition, the book: Explains real-time embedded software modeling and design with finite state machines, Petri nets, and UML, and real-time constraints verification with the model checking tool, NuSMV Features real-world examples in finite state machines, model checking, real-time system design with UML, and more Covers embedded computer programing, designing for reliability, and designing for safety Explains how to make engineering trade-offs of power use and performance Investigates practical issues concerning software reliability, aging, rejuvenation, security, and power management Real-Time Embedded Systems is a valuable resource for those responsible for real-time and embedded software design, development, and management. It is also an excellent textbook for graduate courses in computer engineering, computer science, information technology, and software engineering on embedded and real-time software systems, and for undergraduate computer and software engineering courses"--
_cProvided by publisher.
520 _a"This book offers comprehensive coverage of the convergence of real-time embedded systems scheduling, resource access control, software design and development, and high-level system modeling, analysis and verification"--
_cProvided by publisher.
504 _aIncludes bibliographical references and index.
588 0 _aPrint version record and CIP data provided by publisher.
505 0 _aCover -- Title Page -- Copyright -- Contents -- Preface -- Book Layout -- Acknowledgments -- Chapter 1 Introduction to Real-Time Embedded Systems -- 1.1 Real-Time Embedded Systems -- 1.2 Example: Automobile Antilock Braking System -- 1.2.1 Slip Rate and Brake Force -- 1.2.2 ABS Components -- 1.2.2.1 Sensors -- 1.2.2.2 Valves and Pumps -- 1.2.2.3 Electrical Control Unit -- 1.2.3 ABS Control -- 1.3 Real-Time Embedded System Characteristics -- 1.3.1 System Structure -- 1.3.2 Real-Time Response -- 1.3.3 Highly Constrained Environments -- 1.3.4 Concurrency -- 1.3.5 Predictability -- 1.3.6 Safety and Reliability -- 1.4 Hard and Soft Real-Time Embedded Systems -- Suggestions for Reading -- References -- Chapter 2 Hardware Components -- 2.1 Processors -- 2.1.1 Microprocessors -- 2.1.2 Microcontrollers -- 2.1.3 Application-Specific Integrated Circuits (ASICs) -- 2.1.4 Field-Programmable Gate Arrays (FPGAs) -- 2.1.5 Digital Signal Processors (DSPs) -- 2.1.6 Application-Specific Instruction Set Processors (ASIPs) -- 2.1.7 Multicore Processors -- 2.1.8 Von Neumann Architecture and Harvard Architecture -- 2.1.9 Complex Instruction Set Computing and Reduced Instruction Set Computing -- 2.2 Memory and Cache -- 2.2.1 Read-Only Memory (ROM) -- 2.2.2 Random-Access Memory (RAM) -- 2.2.3 Cache Memory -- 2.3 I/O Interfaces -- 2.4 Sensors and Actuators -- 2.5 Timers and Counters -- Suggestions for Reading -- References -- Chapter 3 Real-Time Operating Systems -- 3.1 Main Functions of General-Purpose Operating Systems -- 3.1.1 Process Management -- 3.1.2 Memory Management -- 3.1.3 Interrupts Management -- 3.1.4 Multitasking -- 3.1.5 File System Management -- 3.1.6 I/O Management -- 3.2 Characteristics of RTOS Kernels -- 3.2.1 Clocks and Timers -- 3.2.2 Priority Scheduling -- 3.2.3 Intertask Communication and Resource Sharing -- 3.2.3.1 Real-Time Signals.
505 8 _a3.2.3.2 Semaphores -- 3.2.3.3 Message Passing -- 3.2.3.4 Shared Memory -- 3.2.4 Asynchronous I/O -- 3.2.5 Memory Locking -- 3.3 RTOS Examples -- 3.3.1 LynxOS -- 3.3.2 OSE -- 3.3.3 QNX -- 3.3.4 VxWorks -- 3.3.5 Windows Embedded Compact -- Suggestions for Reading -- References -- URLs -- Chapter 4 Task Scheduling -- 4.1 Tasks -- 4.1.1 Task Specification -- 4.1.2 Task States -- 4.1.3 Precedence Constraints -- 4.1.4 Task Assignment and Scheduling -- 4.2 Clock-Driven Scheduling -- 4.2.1 Structured Clock-Driven Scheduling -- 4.2.1.1 Frames -- 4.2.1.2 Task Slicing -- 4.2.2 Scheduling Aperiodic Tasks -- 4.2.3 Scheduling Sporadic Tasks -- 4.3 Round-Robin Approach -- 4.4 Priority-Driven Scheduling Algorithms -- 4.4.1 Fixed-Priority Algorithms -- 4.4.1.1 Schedulability Test Based on Time Demand Analysis -- 4.4.1.2 Deadline-Monotonic Algorithm -- 4.4.2 Dynamic-Priority Algorithms -- 4.4.2.1 Earliest-Deadline-First (EDF) Algorithm -- 4.4.2.2 Optimality of EDF -- 4.4.3 Priority-Driven Scheduling of Aperiodic and Sporadic Tasks -- 4.4.3.1 Scheduling of Aperiodic Tasks -- 4.4.3.2 Scheduling of Sporadic Tasks -- 4.4.4 Practical Factors -- 4.4.4.1 Nonpreemptivity -- 4.4.4.2 Self-Suspension -- 4.4.4.3 Context Switches -- 4.4.4.4 Schedulability Test -- 4.5 Task Assignment -- 4.5.1 Bin-Packing Algorithms -- 4.5.1.1 First-Fit Algorithm -- 4.5.1.2 First-Fit Decreasing Algorithm -- 4.5.1.3 Rate-Monotonic First-Fit (RMFF) Algorithm -- 4.5.2 Assignment with Communication Cost -- Suggestions for Reading -- References -- Chapter 5 Resource Sharing and Access Control -- 5.1 Resource Sharing -- 5.1.1 Resource Operation -- 5.1.2 Resource Requirement Specification -- 5.1.3 Priority Inversion and Deadlocks -- 5.1.4 Resource Access Control -- 5.2 Nonpreemptive Critical Section Protocol -- 5.3 Priority Inheritance Protocol -- 5.3.1 Rules of Priority Inheritance Protocol.
505 8 _a5.3.2 Properties of Priority Inheritance Protocol -- 5.4 Priority Ceiling Protocol -- 5.4.1 Rules of Priority Ceiling Protocol -- 5.4.2 Properties of Priority Ceiling Protocol -- 5.4.3 Worst-Case Blocking Time -- 5.5 Stack-Sharing Priority Ceiling Protocol -- 5.5.1 Rules of Stack-Sharing Priority Ceiling Protocol -- 5.5.2 Properties of Stack-Sharing Priority Ceiling Protocol -- Suggestion for Reading -- References -- Chapter 6 Concurrent Programming -- 6.1 Introduction -- 6.2 POSIX Threads -- 6.3 Synchronization Primitives -- 6.3.1 Race Conditions and Critical Sections -- 6.3.2 Mutex -- 6.3.3 Condition Variables -- 6.3.4 Semaphores -- 6.4 Communication among Tasks -- 6.4.1 Message Queues -- 6.4.2 Shared Memory -- 6.4.3 Shared Memory Protection -- 6.5 Real-Time Facilities -- 6.5.1 Real-Time Signals -- 6.5.1.1 Blocking Signals -- 6.5.1.2 Dealing with Signals -- 6.5.2 Timers -- 6.5.3 Implement Periodic Tasks -- 6.5.3.1 Using sleep() Function -- 6.5.3.2 Using Timers -- 6.5.4 Implement an Application with Multiple Periodic Tasks -- Suggestions for Reading -- References -- Chapter 7 Finite-State Machines -- 7.1 Finite State Machine Basics -- 7.2 Deterministic Finite Automation (DFA) -- 7.2.1 Moore Machines -- 7.2.2 Mealy Machines -- 7.3 Nondeterministic Finite Automation -- 7.4 Programming Finite-State Machines -- Suggestions for Reading -- References -- Chapter 8 UML State Machines -- 8.1 States -- 8.2 Transitions -- 8.3 Events -- 8.4 Composite States -- 8.4.1 Hierarchy -- 8.4.2 Orthogonality -- 8.4.3 Submachine States -- 8.5 Pseudostates -- 8.5.1 History Pseudostates -- 8.5.2 Entry and Exit Points -- 8.5.3 Fork and Join Pseudostates -- 8.5.4 Terminate Pseudostates -- 8.6 UML State Machine of Antilock Braking System -- Suggestions for Reading -- References -- Chapter 9 Timed Petri Nets -- 9.1 Petri Net Definition -- 9.1.1 Transition Firing.
505 8 _a9.1.2 Modeling Power -- 9.2 Petri Net Properties -- 9.2.1 Behavioral Properties -- 9.2.1.1 Reachability -- 9.2.1.2? Markings -- 9.2.1.3 Reachability Analysis Algorithm -- 9.2.1.4 Boundedness and Safeness -- 9.2.1.5 Liveness -- 9.2.2 Structural Properties -- 9.2.2.1 T-Invariants and S-Invariants -- 9.2.2.2 Siphons and Traps -- 9.3 Timed Petri Nets -- 9.3.1 Deterministic Timed Petri Nets -- 9.3.1.1 Performance Evaluation Based on DTPNs -- 9.3.2 Time Petri Nets -- 9.3.2.1 States in a Time Petri Net -- 9.3.2.2 Enabling and Firing Conditions of Transitions -- 9.3.2.3 Firing Rules -- Suggestions for Reading -- References -- Chapter 10 Model Checking -- 10.1 Introduction to Model Checking -- 10.2 Temporal Logic -- 10.2.1 Linear Temporal Logic -- 10.2.1.1 Syntax of LTL -- 10.2.1.2 Parse Trees for LTL Formulas -- 10.2.1.3 Semantics of LTL -- 10.2.1.4 Equivalencies of LTL Formulas -- 10.2.1.5 System Property Specification -- 10.2.2 Computation Tree logic -- 10.2.2.1 Syntax of CTL -- 10.2.2.2 Semantics of CTL -- 10.2.2.3 Equivalencies of CTL Formulas -- 10.2.3 LTL versus CTL -- 10.3 The NuSMV Model Checking Tool -- 10.3.1 Description Language -- 10.3.1.1 Single-Module SMV Program -- 10.3.1.2 Multimodule SMV Program -- 10.3.1.3 Asynchronous Systems -- 10.3.2 Specifications -- 10.3.3 Running NuSMV -- 10.4 Real-Time Computation Tree Logic -- Suggestions for Reading -- References -- Chapter 11 Practical Issues -- 11.1 Software Reliability -- 11.1.1 Software Faults -- 11.1.2 Reliability Measurement -- 11.1.3 Improving Software Reliability -- 11.1.3.1 Fault Avoidance -- 11.1.3.2 Fault Removal -- 11.1.3.3 Fault Tolerance -- 11.1.3.4 Fault Recovery -- 11.2 Software Aging and Rejuvenation -- 11.3 Security -- 11.3.1 Challenges -- 11.3.2 Common Vulnerabilities -- 11.3.3 Secure Software Design -- 11.4 Safety -- 11.5 Power Conservation -- Suggestions for Reading.
650 0 _aEmbedded computer systems.
_97792
650 0 _aReal-time data processing.
_97793
650 7 _aTECHNOLOGY & ENGINEERING
_xElectronics
_xMicroelectronics.
_2bisacsh
_96697
650 7 _aEmbedded computer systems.
_2fast
_0(OCoLC)fst00908298
_97792
650 7 _aReal-time data processing.
_2fast
_0(OCoLC)fst01091219
_97793
655 0 _aElectronic book.
_97794
655 4 _aElectronic books.
_93294
776 0 8 _iPrint version:
_aWang, Jiacun, 1963-
_tReal-time embedded systems.
_dHoboken, NJ, USA : Wiley, 2017
_z9781118116173
_w(DLC) 2017015038
856 4 0 _uhttps://doi.org/10.1002/9781119420712
_zWiley Online Library
942 _cEBK
994 _aC0
_bDG1
999 _c68951
_d68951