A calculus of mobile processes, I
Information and Computation
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Well-structured transition systems everywhere!
Theoretical Computer Science
Communication and Concurrency
A generic type system for the Pi-calculus
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
Information and Computation
A theory of contracts for web services
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Sessions and Pipelines for Structured Service Programming
FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
A Type System for Client Progress in a Service-Oriented Calculus
Concurrency, Graphs and Models
Spatial and Behavioral Types in the Pi-Calculus
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Contract-Based Discovery and Composition of Web Services
Formal Methods for Web Services
Contracts for Mobile Processes
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Journal of Computer and System Sciences
A theory for strong service compliance
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Contract based multi-party service composition
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Towards a unifying theory for choreography conformance and contract compliance
SC'07 Proceedings of the 6th international conference on Software composition
SCC: a service centered calculus
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
A formal account of contracts for web services
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
Behavioural contracts with request-response operations
Science of Computer Programming
| Hi-index | 0.00 |
In the context of service-oriented computing, behavioural contracts are abstract descriptions of the message-passing behaviour of services. They can be used to check properties of service compositions such as, for instance, client-service compliance. Previous formal models for contracts consider unidirectional send and receive operations. In this paper, we present two models for contracts with bidirectional request-response operations, in the presence of unboundedly many instances of both clients and servers. The first model takes inspiration from the abstract service interface language WSCL, the second one is inspired by Abstract WS-BPEL. We prove that client-service compliance is decidable in the former while it is undecidable in the latter, thus showing an interesting expressiveness gap between the modeling of request-response operations in WSCL and in Abstract WS-BPEL.