Muutke küpsiste eelistusi

Modeling Software Behavior: A Craftsman's Approach [Kõva köide]

4.38/5 (23 hinnangut Goodreads-ist)
(Grand Valley State University, Allendale, Michigan, USA)
  • Formaat: Hardback, 222 pages, kõrgus x laius: 234x156 mm, kaal: 453 g
  • Ilmumisaeg: 21-Jul-2009
  • Kirjastus: Auerbach
  • ISBN-10: 142008075X
  • ISBN-13: 9781420080759
Teised raamatud teemal:
Modeling Software Behavior: A Craftsman's ApproachSuurem pilt
  • Formaat: Hardback, 222 pages, kõrgus x laius: 234x156 mm, kaal: 453 g
  • Ilmumisaeg: 21-Jul-2009
  • Kirjastus: Auerbach
  • ISBN-10: 142008075X
  • ISBN-13: 9781420080759
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9781420080759.html
Märksõnad:
Writing in a conversational style with a sense of humor and clear explanations, Jorgensen (Grand Valley State University) identifies six software behavioral models and describes the capabilities and limitations of each, in this resource for software engineers, developers, and technicians, especially those concerned with testing. Math background and an introduction to issues in behavioral modeling pave the way for exploration of topics including flowcharts, decision tables, finite state machines, two variations of Petri Nets, and StateCharts. Eleven continuing examples are introduced, five of which are illustrated with the six models, making it easy to compare the expressive power of the various models. The examples are chosen to reflect a wide variety of behavioral issues, from simple computational problems to complex event-driven problems. Chapter exercises are included. The text is based on a course on requirements specification models taught by the author at universities and in corporate environments. Annotation ©2009 Book News, Inc., Portland, OR (booknews.com)
Preface xiii
Issues in Behavior Modeling
1(16)
Views of Models
1(1)
Models of Software
2(12)
Traditional Goals
3(1)
Consistency
3(1)
Completeness
4(1)
Clarity
5(1)
Appropriate Goals
6(1)
Executability
7(1)
Provocation
7(1)
Processability
8(1)
Modeling Dichotomies
9(1)
Analysis/Synthesis
9(1)
Composition/Decomposition
9(1)
Prescribed/Proscribed Behavior
10(1)
Is/does
11(1)
Fundamental Elements of Modeling
12(1)
Data
12(1)
Actions
12(1)
Events
13(1)
Threads
13(1)
Devices
13(1)
Propositions
13(1)
Other Issues
14(1)
Size and Complexity
14(1)
Time
14(1)
Concurrency
14(1)
References
14(3)
Math Background
17(14)
Graphs
17(6)
Degree of a Node
18(1)
Incidence Matrices
19(1)
Adjacency Matrices
20(1)
Paths
20(1)
Connectedness
21(1)
Condensation Graphs
22(1)
Cyclomatic Number
22(1)
Directed Graphs
23(6)
Indgrees and Outdegrees
23(1)
Types of Nodes
24(1)
Adjacency Matrix of a Directed Graph
25(1)
Paths and Semipaths
26(1)
Reachability Matrix
26(1)
n-Connectedness
27(1)
Strong Components
28(1)
Model-Based Testing
29(1)
References
29(2)
Examples
31(18)
Issues in Behavior Modeling
31(3)
Structured Programming Constructs
31(1)
Task Management
32(1)
Events
33(1)
Context-Sensitive Input Events
33(1)
Multiple-Context Output Events
34(1)
Discrete and Continuous Events
34(1)
Event Orders
34(1)
Continuing Examples
34(7)
Simplified U.S. 1040EZ Income Tax Form
34(2)
The NextDate Function
36(1)
Espresso Vending Machine (Full Version)
36(1)
Espresso Vending Machine (Six-Coin Version)
37(1)
Smart Fuel Pump
37(3)
Saturn Windshield Wiper Controller
40(1)
Examples for Readers
41(6)
Windchill Factor Table
41(1)
The Previous Date Function
42(1)
Saturn Cruise Control
42(1)
Programmable Thermostat
43(1)
Railroad Crossing Gate Controller
44(1)
The Pizza Robot
45(2)
Issues in the Examples
47(1)
References
48(1)
Flowcharts
49(14)
Definition and Notation
49(1)
Technique
50(3)
Continuing Examples
53(5)
Simplified U.S. 1040EZ Income Tax Form
53(1)
The NextDate Function
54(1)
Espresso Vending Machine
55(1)
Smart Fuel Pump
55(2)
Saturn Windshield Wiper Controller
57(1)
Selected Examples for Readers
58(2)
Saturn Cruise Control
58(1)
The Pizza Robot
59(1)
Advantages and Limitations
60(3)
Decision Tables
63(22)
Definition and Notation
63(1)
Decision Table Analysis
64(5)
Decision Table Condensation
64(1)
Decision Tables with Mutually Exclusive Conditions
65(2)
Redundant and Inconsistent Decision Tables
67(2)
Continuing Examples
69(12)
Simplified U.S. 1040EZ Income Tax Form
69(1)
The NextDate Function
70(1)
First Try
70(1)
Second Try
71(1)
Third Try
72(5)
Espresso Vending Machine
77(2)
Smart Fuel Pump
79(2)
Saturn Windshield Wiper Controller
81(1)
Decision Table Engines
81(1)
Advantages and Limitations
81(2)
References
83(2)
Finite State Machines
85(22)
Definition and Notation
85(2)
Technique
87(3)
Continuing Examples
90(13)
Simplified U.S. 1040EZ Income Tax Form
90(1)
The Next Date Function
90(2)
Espresso Vending Machine
92(2)
Smart Fuel Pump
94(5)
Saturn Windshield Wiper Controller
99(4)
Finite State Machine Engines
103(1)
Advantages and Limitations
104(2)
References
106(1)
Petri Nets
107(30)
Definition and Notation
107(6)
Transition Enabling and Firing
108(2)
Petri Net Conflict
110(1)
The Producer-Consumer Problem
110(3)
Technique
113(7)
Sequence, Selection, and Repetition
113(1)
Enable, Disable, and Activate
114(1)
Trigger
115(1)
Suspend, Resume, and Pause
116(1)
Conflict and Priority
117(1)
Mutual Exlusion
117(1)
Synchronization
117(1)
Some Consequences of Marking and Enabling
118(2)
Examples
120(12)
Simplified U.S. 1040EZ Income Tax Form
120(1)
The NextDate Function
120(1)
Espresso Vending Machine
121(6)
Smart Fuel Pump
127(2)
Saturn Windshield Wiper Controller
129(3)
Petri Net Engines
132(1)
Advantages and Limitations
133(1)
References
134(3)
Event-Driven Petri Nets
137(18)
Definition and Notation
137(4)
Transition Enabling and Firing
139(2)
Technique
141(2)
Context-Sensitive Input Events
142(1)
Multiple-Context Output Events
142(1)
Event Quiescence
143(1)
Examples
143(8)
Simplified U.S. 1040EZ Income Tax Form
143(1)
The NextDate Function
143(1)
Expresso Vending Machine
143(2)
Smart Fuel Pump
145(3)
Saturn Windshield Wiper Controller
148(3)
Event-Driven Petri Net Engines
151(1)
Advantages and Limitations
152(3)
Statecharts
155(16)
Definition and Notation
155(5)
Technique
160(1)
Examples
161(6)
Simplified U.S. 1040EZ Income Tax Form
161(1)
The NextDate Function
161(1)
Espresso Vending Machine
162(1)
Smart Fuel Pump
163(2)
Saturn Windshield Wiper Controller
165(2)
Statechart Engines
167(1)
Advantages and Limitations
167(3)
References
170(1)
Object-Oriented Models
171(14)
Notation and Technique
172(6)
Use Case Diagrams
172(2)
Activity Diagrams
174(1)
State Machine Diagrams
175(1)
Sequence Diagrams
176(2)
Examples
178(5)
Simplified U.S. 1040EZ Income Tax Form
178(1)
The NextDate Function
178(1)
Espresso Vending Machine
178(1)
Smart Fuel Pump
179(4)
Saturn Windshield Wiper Controller
183(1)
Advantages and Limitations
183(1)
References
183(2)
Model Comparisons
185(16)
Selecting an Appropriate Model
185(5)
Simplified U.S. 1040EZ Income Tax Form
185(2)
The NextDate Function
187(1)
Espresso Vending Machine
187(1)
Smart Fuel Pump
188(1)
Saturn Windshield Wiper Controller
189(1)
A Formal Consolidation of Executable Models
190(8)
Modus Ponens
190(1)
Casting a Decision Table into a Propositional Syllogism
191(2)
Casting a Finite State Machine into a Propositional Syllogism
193(2)
Casting an Event-Driven Petri Net into a Propositional Syllogism
195(1)
Casting a Statechart into a Propositional Syllogism
195(2)
Benefits of the Formalism
197(1)
Acknowledgments
198(3)
Index 201
Jorgensen, Paul C.