000 06268nam a2200913 i 4500
001 7748315
003 IEEE
005 20200421114641.0
006 m o d
007 cr |n|||||||||
008 170118s2016 njua ob 001 eng d
010 _z 2013011613 (print)
020 _a9781118720103
_qelectronic
020 _z9780470905395
_qhardback
020 _z0470905395
_qhardback
024 7 _a10.1002/9781118720103
_2doi
035 _a(CaBNVSL)mat07748315
035 _a(IDAMS)0b0000648584e77e
040 _aCaBNVSL
_beng
_erda
_cCaBNVSL
_dCaBNVSL
050 4 _aTK5105.88813
_b.T37 2014eb
082 0 0 _a004.6/2
_223
100 1 _aTari, Zahir,
_eauthor.
245 1 0 _aVerification of communication protocols in web services :
_bmodel-checking service compositions /
_cZahir Tari, Peter Bertok, Anshuman Mukherjee, RMIT University.
264 1 _aHoboken, New Jersey :
_bWiley,
_c[2014]
264 2 _a[Piscataqay, New Jersey] :
_bIEEE Xplore,
_c[2013]
300 _a1 PDF (xii, 256 pages) :
_billustrations (some color).
336 _atext
_2rdacontent
337 _aelectronic
_2isbdmedia
338 _aonline resource
_2rdacarrier
490 1 _aWiley series on parallel and distributed computing ;
_v83
504 _aIncludes bibliographical references and index.
505 0 _aPREFACE xi -- 1 INTRODUCTION: SERVICE RELIABILITY 1 -- 1.1 Motivation 4 -- 1.2 Technical Challenges 5 -- 1.3 Summary of Earlier Solutions 7 -- 1.4 Summary of New Ways to Verify Web Services 8 -- 1.5 Structure of the Book 10 -- References 11 -- 2 MODEL CHECKING 15 -- 2.1 Advantages and Disadvantages of Model Checking 18 -- 2.2 State-Space Explosion 19 -- 2.3 Model-Checking Tools 22 -- References 25 -- 3 PETRI NETS 27 -- 3.1 Colored Petri Nets 31 -- 3.1.1 CPN ML 31 -- 3.1.2 CPN Syntax and Semantics 35 -- 3.1.3 Timed Colored Petri Nets 41 -- 3.1.4 Multisets 47 -- 3.1.5 CPN Definitions 47 -- 3.2 Hierarchical Colored Petri Nets 49 -- References 55 -- 4 WEB SERVICES 57 -- 4.1 Business Process Execution Language 59 -- 4.2 Spring Framework 70 -- 4.3 JAXB 2 APIs 74 -- 4.3.1 Unmarshaling XML Documents 74 -- 4.3.2 Marshaling Java Objects 75 -- References 76 -- 5 MEMORY-EFFICIENT STATE-SPACE ANALYSIS IN SOFTWARE MODEL CHECKING 77 -- 5.1 Motivation 78 -- 5.2 Overview of the Problem and Solution 79 -- 5.3 Related Work 83 -- 5.4 Models for Memory-Efficient State-Space Analysis 86 -- 5.4.1 Sequential Model 87 -- 5.4.2 Tree Model 98 -- 5.5 Experimental Results 108 -- 5.6 Discussion 112 -- 5.7 Summary 113 -- References 113 -- 6 TIME-EFFICIENT STATE-SPACE ANALYSIS IN SOFTWARE MODEL CHECKING 115 -- 6.1 Motivation 116 -- 6.2 Overview of the Problem and Solution 118 -- 6.3 Overview of Hierarchical Colored Petri Nets 119 -- 6.4 Related Work 123 -- 6.5 Technique for Time-Efficient State-Space Analysis 125 -- 6.5.1 Access Tables and Parameterized Reachability Graph 126 -- 6.5.2 Exploring a Module 129 -- 6.5.3 Access Table and Parameterized Reachability Graph for a Super-module 134 -- 6.5.4 Algorithms for Generating Access Tables and Parameterized Reachability Graphs 137 -- 6.5.5 Additional Memory Cost for Storing Access Tables and Parameterized Reachability Graphs 143 -- 6.5.6 Theoretical Evaluation of the Reduction in Delay 145 -- 6.6 Experimental Results 149 -- 6.7 Discussion 151 -- 6.8 Summary 152 -- References 153 -- 7 GENERATING HIERARCHICAL MODELS BY IDENTIFYING STRUCTURAL SIMILARITIES 155 -- 7.1 Motivation 156 -- 7.2 Overview of the Problem and Solution 158 -- 7.3 Basics of Substitution Transition 160 -- 7.4 Related Work 161 -- 7.5 Method for Installing Hierarchy 162 -- 7.5.1 Lookup Method 163 -- 7.5.2 Clustering Method 189 -- 7.5.3 Time Complexity of the Lookup Algorithm 193 -- 7.6 Experimental Results 194 -- 7.7 Discussion 201 -- 7.8 Summary 202 -- References 203 -- 8 FRAMEWORK FOR MODELING, SIMULATION, AND VERIFICATION OF A BPEL SPECIFICATION 205 -- 8.1 Motivation 206 -- 8.2 Overview of the Problem and Solution 208 -- 8.3 Related Work 209 -- 8.4 Colored Petri Net Semantics for BPEL 211 -- 8.4.1 Component A 211 -- 8.4.2 Component B 214 -- 8.4.3 Object Model for BPEL Activities 217 -- 8.4.4 XML Templates 221 -- 8.4.5 Algorithm for Cloning Templates 234 -- 8.5 Results 236 -- 8.6 Discussion 241 -- 8.7 Summary 242 -- References 242 -- 9 CONCLUSIONS AND OUTLOOK 245 -- 9.1 Results 246 -- 9.2 Discussion 249 -- 9.3 What Could Be Improved? 251 -- References 252 -- INDEX 255.
506 1 _aRestricted to subscribers or individual electronic text purchasers.
520 _a"Provides implementation details of each networking type to help readers to be able to set up Sensor networks in their related job fields"--
_cProvided by publisher.
530 _aAlso available in print.
538 _aMode of access: World Wide Web
588 _aDescription based on PDF viewed 01/18/2017.
650 0 _aWeb services
_xTesting.
650 0 _aComputer network protocols.
655 0 _aElectronic books.
695 _aAnalytical models
695 _aBusiness
695 _aC++ languages
695 _aClustering methods
695 _aComplexity theory
695 _aComputational modeling
695 _aDelays
695 _aExplosions
695 _aFrequency modulation
695 _aHardware
695 _aImage color analysis
695 _aJava
695 _aJoining processes
695 _aManganese
695 _aMathematical model
695 _aMemory management
695 _aModel checking
695 _aObject oriented modeling
695 _aPetri nets
695 _aPorts (Computers)
695 _aProduction facilities
695 _aReceivers
695 _aReliability
695 _aRuntime
695 _aSections
695 _aService-oriented architecture
695 _aSoftware
695 _aSoftware systems
695 _aTransforms
695 _aWeb services
695 _aXML
700 1 _aBert�ok, P�eter,
_d1952-
700 1 _aMukherjee, Anshuman.
710 2 _aIEEE Xplore (Online Service),
_edistributor.
710 2 _aWiley,
_epublisher.
830 0 _aWiley series on parallel and distributed computing ;
_v83
856 4 2 _3Abstract with links to resource
_uhttp://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=7748315
942 _cEBK
999 _c59964
_d59964