Abstract: We investigate the notion of orchestrated compliance for client/server interactions in the context of session contracts. Devising the notion of orchestrator in such a context makes it possible to have orchestrators with unbounded buffering capabilities and at the same time to guarantee any message from the client to be eventually delivered by the orchestrator to the server, while preventing the server from sending messages which are kept indefinitely inside the orchestrator. The compliance relation is shown to be decidable by means of 1) a procedure synthesising the orchestrators, if any, making a client compliant with a server, and 2) a procedure for deciding whether an orchestrator behaves in a proper way as mentioned before.
Recommendations
Cites work
- scientific article; zbMATH DE number 954809 (Why is no real title available?)
- scientific article; zbMATH DE number 1183236 (Why is no real title available?)
- scientific article; zbMATH DE number 1759429 (Why is no real title available?)
- scientific article; zbMATH DE number 7167590 (Why is no real title available?)
- scientific article; zbMATH DE number 7167773 (Why is no real title available?)
- A calculus of mobile processes. II
- Automata for analysing service contracts
- Contract-based discovery of Web services modulo simple orchestrators
- Contracts as games on event structures
- Decidable topologies for communicating automata with FIFO and bag channels
- From orchestration to choreography through contract automata
- Modelling session types using contracts
- Multiparty session types meet communicating automata
- On Communicating Finite-State Machines
- Recursive subtyping revealed
- Sub-behaviour relations for session-based client/server systems
- Subtyping for session types in the pi calculus
- The Must Preorder Revisited
Cited in
(9)- Compliance in behavioural contracts: a brief survey
- Foundations of Software Science and Computation Structures
- Session types and subtyping for orchestrated interactions
- Abstract Processes in Orchestration Languages
- Retractability, games and orchestrators for session contracts
- Reversible client/server interactions
- A fixed-points based framework for compliance of behavioural contracts
- Automated verification of automata communicating via FIFO and bag buffers
- scientific article; zbMATH DE number 7167773 (Why is no real title available?)
This page was built for publication: Orchestrated session compliance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q347361)
