did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9781848002227

A Process Algebraic Approach to Software Architecture Design

by ; ;
  • ISBN13:

    9781848002227

  • ISBN10:

    184800222X

  • Format: Hardcover
  • Copyright: 2009-11-30
  • Publisher: Springer-Nature New York Inc
  • Purchase Benefits
  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $109.99 Save up to $91.43
  • Digital
    $40.22
    Add to Cart

    DURATION
    PRICE

Supplemental Materials

What is included with this book?

Summary

The design and the verification of modern software applications requires the analysis of several different aspects, such as software correctness, quality of service, and security, and of the possible inter-relations among them. Process algebraic architectural languages and the related analysis techniques provide a formal paradigm that allows for the modeling and analysis of such systems and of the related properties during the early stages of the design process. The book presents such a paradigm in a novel way that privileges the discussion of its foundational characteristics and then introduces a number of guidelines, integrated with ad-hoc methodologies and exemplifying case studies, to support the practical benefits of using such a paradigm. The book can be of help for both researchers and graduate students who intend to approach the process algebraic formal paradigm and for the practitioners who intend to apply the related approach to software design and verification.

Table of Contents

Process Calculi and Behavioral Equivalences
Process Algebrap. 3
Concurrency, Communication, and Nondeterminismp. 3
Running Example: Producer-Consumer Systemp. 7
PC: Process Calculus for Nondeterministic Processesp. 7
Syntax: Actions and Behavioral Operatorsp. 8
Semantics: Structural Operational Rulesp. 10
Bisimulation Equivalencep. 13
Equivalence Relations and Preordersp. 13
Definition of the Behavioral Equivalencep. 14
Conditions and Characterizationsp. 16
Congruence Propertyp. 16
Sound and Complete Axiomatizationp. 17
Modal Logic Characterizationp. 18
Verification Algorithmp. 19
Abstracting from Invisible Actionsp. 19
Testing Equivalencep. 23
Definition of the Behavioral Equivalencep. 23
Conditions and Characterizationsp. 24
Congruence Propertyp. 27
Sound and Complete Axiomatizationp. 28
Modal Logic Characterizationp. 29
Verification Algorithmp. 30
Trace Equivalencep. 31
Definition of the Behavioral Equivalencep. 32
Congruence Propertyp. 32
Sound and Complete Axiomatizationp. 33
Modal Logic Characterizationp. 33
Verification Algorithmp. 34
The Linear-Time/Branching-Time Spectrump. 35
Deterministically Timed Process Algebrap. 41
Concurrency, Communication, and Deterministic Timep. 41
Deterministically Timed Process Calculip. 43
TPC: Timed Process Calculus with Durationless Actionsp. 43
DPC: Timed Process Calculus with Durational Actionsp. 46
Deterministically Timed Behavioral Equivalencesp. 50
Definition of Timed Bisimulation Equivalencep. 51
Congruence Propertyp. 52
Sound and Complete Axiomatizationp. 53
Modal Logic Characterizationp. 53
Verification Algorithmp. 55
Durational Bisimulation Equivalence and its Propertiesp. 55
Semantics-Preserving Mapping for Eagernessp. 57
Differences Between TPC and DPCp. 57
From DPC to TPC Under Eagernessp. 58
Semantics-Preserving Mapping for Lazinessp. 59
Lazy TPCp. 59
Lazy DPCp. 60
From DPC to TPC Under Lazinessp. 63
Semantics-Preserving Mapping for Maximal Progressp. 63
Maximal Progress TPCp. 64
Maximal Progress DPCp. 64
From DPC to TPC Under Maximal Progressp. 67
Expressiveness of Eagerness, Laziness, Maximal Progressp. 67
Synchronization Issuesp. 68
Choosing at Different Timesp. 70
Performing Infinitely Many Actions at the Same Timep. 71
Performing Finitely Many Actions at the Same Timep. 72
Coincidence Result for Sequential Processesp. 73
Stochastically Timed Process Algebrap. 75
Concurrency, Communication, and Stochastic Timep. 75
MPC: Markovian Process Calculus with Durational Actionsp. 78
Markov Chainsp. 78
Syntax and Semanticsp. 80
Markovian Bisimulation Equivalencep. 84
Exit Rates and Exit Probabilitiesp. 85
Definition of the Behavioral Equivalencep. 86
Conditions and Characterizationsp. 88
Congruence Propertyp. 89
Sound and Complete Axiomatizationp. 90
Modal Logic Characterizationp. 91
Verification Algorithmp. 92
Abstracting from Invisible Actions with Zero Durationp. 93
Markovian Testing Equivalencep. 99
Probability and Duration of Computationsp. 99
Definition of the Behavioral Equivalencep. 101
Conditions and Characterizationsp. 103
Congruence Propertyp. 108
Sound and Complete Axiomatizationp. 109
Modal Logic Characterizationp. 110
Verification Algorithmp. 112
Markovian Trace Equivalencep. 114
Definition of the Behavioral Equivalencep. 114
Conditions and Characterizationsp. 116
Congruence Propertyp. 117
Sound and Complete Axiomatizationp. 117
Modal Logic Characterizationp. 118
Verification Algorithmp. 119
Exactness of Markovian Behavioral Equivalencesp. 120
The Markovian Linear-Time/Branching-Time Spectrump. 121
Process Algebra for Software Architecture
Component-Oriented Modelingp. 127
Software Architecture Description Languagesp. 127
Running Example: Client-Server Systemp. 129
Architectural Upgrade of Process Algebra: Guidelinesp. 129
G1: Separating Behavior and Topology Descriptionsp. 129
G2: Reusing Component and Connector Specificationp. 129
G3: Eliciting Component and Connector Interfacep. 130
G4: Classifying Communication Synchronicityp. 131
G5: Classifying Communication Multiplicityp. 132
G6: Textual and Graphical Notations (PADL Syntax)p. 133
G7: Dynamic and Static Operatorsp. 135
Translation Semantics for PADLp. 138
Semantics of Individual Elementsp. 139
Semantics of Interacting Elementsp. 144
Summarizing Example: Pipe-Filter Systemp. 147
G8: Supporting Architectural Stylesp. 152
Architectural Typesp. 153
Hierarchical Modelingp. 154
Behavioral Conformityp. 156
Exogenous Variationsp. 158
Endogenous Variationsp. 160
Multiplicity Variationsp. 163
Comparisonsp. 164
Comparison with Process Algebrap. 164
Comparison with Parallel Composition Operatorsp. 165
Comparison with Other Software Architecture Languagesp. 166
Component-Oriented Functional Verificationp. 169
Mismdet: Architecture-Level Mismatch Detectionp. 169
Class of Properties and Detection Strategyp. 170
Architectural Compatibility of Star-Shaped Topologiesp. 173
Case Study: Compressing Proxy Systemp. 174
Architectural Interoperability of Cycle-Shaped Topologiesp. 179
Case Study: Cruise Control Systemp. 183
Generalization to Arbitrary Topologiesp. 188
Case Study: Simulator for the Cruise Control Systemp. 190
Generalization to Architectural Typesp. 193
Generalization to Internal Behavioral Variationsp. 193
Generalization to Exogenous Variationsp. 194
Generalization to Endogenous Variationsp. 197
Generalization to Multiplicity Variationsp. 199
Comparisonsp. 199
Component-Oriented Performance Evaluationp. 203
Perfsel: Performance-Driven Architectural Selectionp. 203
Class of Measures and Selection Strategyp. 205
Emilia: Extending PADL with Performance Aspectsp. 208
Queueing Systems and Queueing Networksp. 211
From ÆEmilia Descriptions to Queueing Networksp. 216
General Syntactical Restrictionsp. 217
Queueing Network Basic Elementsp. 218
Documental Functionsp. 223
Characterizing Functionsp. 223
Case Study: Selecting Compiler Architecturesp. 225
Sequential Architecturep. 225
Pipeline Architecturep. 229
Concurrent Architecturep. 234
Scenario-Based Performance Selectionp. 236
Comparisonsp. 238
Trading Dependability and Performancep. 239
DepPerf: Mixed View of Dependability and Performancep. 239
Running Example: Multilevel Security Routing Systemp. 242
First Phase of DepPerf: Noninterference Analysisp. 244
Noninterference Theoryp. 245
Noninterference Verificationp. 246
Component-Oriented Noninterference Checkp. 249
Interpretation and Feedbackp. 252
Second Phase of DepPerf: Performance Evaluationp. 255
Model Validationp. 256
Analysis and Tuningp. 256
Measure Specification Languagep. 258
Case Study I: The Network NRL Pumpp. 260
Informal Specificationp. 260
Architectural Descriptionp. 262
Noninterference Analysisp. 267
Performance Evaluationp. 272
Case Study II: Power-Manageable Systemp. 276
Informal Specificationp. 276
Architectural Descriptionp. 278
Noninterference Analysisp. 281
Performance Evaluationp. 284
Comparisonsp. 287
Referencesp. 291
Indexp. 301
Table of Contents provided by Ingram. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program