A theory of contracts for strong service compliance

DOI10.1017/S0960129509007658zbMath1186.68318OpenAlexW2164834097MaRDI QIDQ3636912

Gianluigi Zavattaro, Mario Bravetti

Publication date: 30 June 2009

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129509007658

zbMATH Keywords

refinementstrong subcontract pre-order

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (6)

Compliance in Behavioural Contracts: A Brief Survey ⋮ Contracts for cross-organizational workflows as timed dynamic condition response graphs ⋮ Fair refinement for asynchronous session types ⋮ An algebraic theory for web service contracts ⋮ Fair subtyping for multi-party session types ⋮ Unnamed Item

Cites Work

• Fair testing
• Testing equivalences for processes
• A theory of contracts for web services
• Contract Based Multi-party Service Composition
• The Must Preorder Revisited
• Structured Communication-Centred Programming for Web Services

This page was built for publication: A theory of contracts for strong service compliance