Process Calculi and Behavioral Equivalences / Part 1: |
Process Algebra / 1: |
Concurrency, Communication, and Nondeterminism / 1.1: |
Running Example: Producer-Consumer System / 1.2: |
PC: Process Calculus for Nondeterministic Processes / 1.3: |
Syntax: Actions and Behavioral Operators / 1.3.1: |
Semantics: Structural Operational Rules / 1.3.2: |
Bisimulation Equivalence / 1.4: |
Equivalence Relations and Preorders / 1.4.1: |
Definition of the Behavioral Equivalence / 1.4.2: |
Conditions and Characterizations / 1.4.3: |
Congruence Property / 1.4.4: |
Sound and Complete Axiomatization / 1.4.5: |
Modal Logic Characterization / 1.4.6: |
Verification Algorithm / 1.4.7: |
Abstracting from Invisible Actions / 1.4.8: |
Testing Equivalence / 1.5: |
Trace Equivalence / 1.5.1: |
The Linear-Time/Branching-Time Spectrum / 1.6.1: |
Deterministically Timed Process Algebra / 2: |
Concurrency, Communication, and Deterministic Time / 2.1: |
Deterministically Timed Process Calculi / 2.2: |
TPC: Timed Process Calculus with Durationless Actions / 2.2.1: |
DPC: Timed Process Calculus with Durational Actions / 2.2.2: |
Deterministically Timed Behavioral Equivalences / 2.3: |
Definition of Timed Bisimulation Equivalence / 2.3.1: |
Durational Bisimulation Equivalence and its Properties / 2.3.2: |
Semantics-Preserving Mapping for Eagerness / 2.4: |
Differences Between TPC and DPC / 2.4.1: |
From DPC to TPC Under Eagerness / 2.4.2: |
Semantics-Preserving Mapping for Laziness / 2.5: |
Lazy TPC / 2.5.1: |
Lazy DPC / 2.5.2: |
From DPC to TPC Under Laziness / 2.5.3: |
Semantics-Preserving Mapping for Maximal Progress / 2.6: |
Maximal Progress TPC / 2.6.1: |
Maximal Progress DPC / 2.6.2: |
From DPC to TPC Under Maximal Progress / 2.6.3: |
Expressiveness of Eagerness, Laziness, Maximal Progress / 2.7: |
Synchronization Issues / 2.7.1: |
Choosing at Different Times / 2.7.2: |
Performing Infinitely Many Actions at the Same Time / 2.7.3: |
Performing Finitely Many Actions at the Same Time / 2.7.4: |
Coincidence Result for Sequential Processes / 2.7.5: |
Stochastically Timed Process Algebra / 3: |
Concurrency, Communication, and Stochastic Time / 3.1: |
MPC: Markovian Process Calculus with Durational Actions / 3.2: |
Markov Chains / 3.2.1: |
Syntax and Semantics / 3.2.2: |
Markovian Bisimulation Equivalence / 3.3: |
Exit Rates and Exit Probabilities / 3.3.1: |
Abstracting from Invisible Actions with Zero Duration / 3.3.2: |
Markovian Testing Equivalence / 3.4: |
Probability and Duration of Computations / 3.4.1: |
Markovian Trace Equivalence / 3.4.2: |
Exactness of Markovian Behavioral Equivalences / 3.5.1: |
The Markovian Linear-Time/Branching-Time Spectrum / 3.7: |
Process Algebra for Software Architecture / Part II: |
Component-Oriented Modeling / 4: |
Software Architecture Description Languages / 4.1: |
Running Example: Client-Server System / 4.2: |
Architectural Upgrade of Process Algebra: Guidelines / 4.3: |
G1: Separating Behavior and Topology Descriptions / 4.3.1: |
G2: Reusing Component and Connector Specification / 4.3.2: |
G3: Eliciting Component and Connector Interface / 4.3.3: |
G4: Classifying Communication Synchronicity / 4.3.4: |
G5: Classifying Communication Multiplicity / 4.3.5: |
G6: Textual and Graphical Notations (PADL Syntax) / 4.3.6: |
G7: Dynamic and Static Operators / 4.3.7: |
Translation Semantics for PADL / 4.4: |
Semantics of Individual Elements / 4.4.1: |
Semantics of Interacting Elements / 4.4.2: |
Summarizing Example: Pipe-Filter System / 4.5: |
G8: Supporting Architectural Styles / 4.6: |
Architectural Types / 4.6.1: |
Hierarchical Modeling / 4.6.2: |
Behavioral Conformity / 4.6.3: |
Exogenous Variations / 4.6.4: |
Endogenous Variations / 4.6.5: |
Multiplicity Variations / 4.6.6: |
Comparisons / 4.7: |
Comparison with Process Algebra / 4.7.1: |
Comparison with Parallel Composition Operators / 4.7.2: |
Comparison with Other Software Architecture Languages / 4.7.3: |
Component-Oriented Functional Verification / 5: |
Mismdet: Architecture-Level Mismatch Detection / 5.1: |
Class of Properties and Detection Strategy / 5.2: |
Architectural Compatibility of Star-Shaped Topologies / 5.3: |
Case Study: Compressing Proxy System / 5.3.1: |
Architectural Interoperability of Cycle-Shaped Topologies / 5.4: |
Case Study: Cruise Control System / 5.4.1: |
Generalization to Arbitrary Topologies / 5.5: |
Case Study: Simulator for the Cruise Control System / 5.5.1: |
Generalization to Architectural Types / 5.6: |
Generalization to Internal Behavioral Variations / 5.6.1: |
Generalization to Exogenous Variations / 5.6.2: |
Generalization to Endogenous Variations / 5.6.3: |
Generalization to Multiplicity Variations / 5.6.4: |
Component-Oriented Performance Evaluation / 5.7: |
Perfsel: Performance-Driven Architectural Selection / 6.1: |
Class of Measures and Selection Strategy / 6.2: |
Emilia: Extending PADL with Performance Aspects / 6.3: |
Queueing Systems and Queueing Networks / 6.4: |
From ÆEmilia Descriptions to Queueing Networks / 6.5: |
General Syntactical Restrictions / 6.5.1: |
Queueing Network Basic Elements / 6.5.2: |
Documental Functions / 6.5.3: |
Characterizing Functions / 6.5.4: |
Case Study: Selecting Compiler Architectures / 6.6: |
Sequential Architecture / 6.6.1: |
Pipeline Architecture / 6.6.2: |
Concurrent Architecture / 6.6.3: |
Scenario-Based Performance Selection / 6.6.4: |
Trading Dependability and Performance / 6.7: |
DepPerf: Mixed View of Dependability and Performance / 7.1: |
Running Example: Multilevel Security Routing System / 7.2: |
First Phase of DepPerf: Noninterference Analysis / 7.3: |
Noninterference Theory / 7.3.1: |
Noninterference Verification / 7.3.2: |
Component-Oriented Noninterference Check / 7.3.3: |
Interpretation and Feedback / 7.3.4: |
Second Phase of DepPerf: Performance Evaluation / 7.4: |
Model Validation / 7.4.1: |
Analysis and Tuning / 7.4.2: |
Measure Specification Language / 7.4.3: |
Case Study I: The Network NRL Pump / 7.5: |
Informal Specification / 7.5.1: |
Architectural Description / 7.5.2: |
Noninterference Analysis / 7.5.3: |
Performance Evaluation / 7.5.4: |
Case Study II: Power-Manageable System / 7.6: |
References / 7.6.1: |
Index |
Process Calculi and Behavioral Equivalences / Part 1: |
Process Algebra / 1: |
Concurrency, Communication, and Nondeterminism / 1.1: |