The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Woflan: a Petri-net-based workflow analyzer
Systems Analysis Modelling Simulation
Component-based software architectures: a framework based on inheritance of behavior
Science of Computer Programming
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Relaxed Soundness of Business Processes
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
The P2P Approach to Interorganizational Workflows
CAiSE '01 Proceedings of the 13th International Conference on Advanced Information Systems Engineering
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Analysis of interacting BPEL web services
Proceedings of the 13th international conference on World Wide Web
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Semantics and analysis of business process models in BPMN
Information and Software Technology
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
25 Years of Model Checking
Symbolic Abstraction and Deadlock-Freeness Verification of Inter-enterprise Processes
BPM '09 Proceedings of the 7th International Conference on Business Process Management
The Computer Journal
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Woflan 2.0: a Petri-net-based workflow diagnosis tool
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Constraint-based workflow models: change made easy
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Comparing LTL Semantics for Runtime Verification
Journal of Logic and Computation
WISEW'03 Proceedings of the Fourth international conference on Web information systems engineering workshops
Soundness of workflow nets: classification, decidability, and analysis
Formal Aspects of Computing
Analysis on demand: Instantaneous soundness checking of industrial business process models
Data & Knowledge Engineering
Symbolic abstraction and deadlock-freeness verification of inter-enterprise processes
Data & Knowledge Engineering
Monitoring business constraints with linear temporal logic: an approach based on colored automata
BPM'11 Proceedings of the 9th international conference on Business process management
A declarative approach for flexible business processes management
BPM'06 Proceedings of the 2006 international conference on Business Process Management Workshops
Analyzing web service based business processes
FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
DecSerFlow: towards a truly declarative service flow language
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A Petri Net Approach to Analysis and Composition of Web Services
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Runtime verification of LTL-Based declarative process models
RV'11 Proceedings of the Second international conference on Runtime verification
Checking soundness of business processes compositionally using symbolic observation graphs
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Formal Abstraction and Compatibility Checking of Web Services
ICWS '13 Proceedings of the 2013 IEEE 20th International Conference on Web Services
Hi-index | 0.00 |
For automatically composing Web services in a correct manner, information about their behaviors an abstract model has to be published in a repository. This abstract model must be sufficient to decide whether two, or more, services are compatible the composition is possible is possible without including any additional information that can be used to disclose the privacy of these services. The compatibility between two Web services can be based either on some generic properties e.g. deadlock freeness of the composite Web service or on a specific property expressed with a formal logic. In this paper, the authors address this problem by considering these two kinds of compatibility criteria. The first criterion is defined by different variants of the well-known soundness property on open workflow nets. These properties guarantee the absence of livelocks, deadlocks and other anomalies that can be formulated without domain knowledge. The second criterion is defined by the designer formally by using the Linear Temporal Logic. The proposed approach addresses the automatic abstraction of Web services and the checking of their compatibility using their abstract models only. To abstract Web services, the authors use the symbolic observation graph SOG approach that preserves necessary information for service composition and hides private information. The authors show how the SOG can be adapted and used so that the verification of generic and specific compatibility criteria can be performed on the composition of the abstract models of Web services instead of the original composite service.