CONTENTS
1 INTRODUCTION: SERVICE RELIABILITY
1.3 Summary of Earlier Solutions
1.4 Summary of New Ways to Verify Web Services
2.1 Advantages and Disadvantages of Model Checking
3.1.2 CPN Syntax and Semantics
3.1.3 Timed Colored Petri Nets
3.2 Hierarchical Colored Petri Nets
4.1 Business Process Execution Language
4.3.1 Unmarshaling XML Documents
5 MEMORY-EFFICIENT STATE-SPACE ANALYSIS IN SOFTWARE MODEL CHECKING
5.2 Overview of the Problem and Solution
5.4 Models for Memory-Efficient State-Space Analysis
6 TIME-EFFICIENT STATE-SPACE ANALYSIS IN SOFTWARE MODEL CHECKING
6.2 Overview of the Problem and Solution
6.3 Overview of Hierarchical Colored Petri Nets
6.5 Technique for Time-Efficient State-Space Analysis
6.5.1 Access Tables and Parameterized Reachability Graph
6.5.3 Access Table and Parameterized Reachability Graph for a Super-module
6.5.4 Algorithms for Generating Access Tables and Parameterized Reachability Graphs
Get Verification of Communication Protocols in Web Services: Model-Checking Service Compositions now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.