Contract-based discovery of Web services modulo simple orchestrators

DOI10.1016/j.tcs.2010.05.002zbMath1209.68038OpenAlexW2062339792MaRDI QIDQ987977

Luca Padovani

Publication date: 24 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2318/70905

zbMATH Keywords

orchestrationbehavioral contractstesting semanticsccsWeb service discovery

Mathematics Subject Classification ID

Internet topics (68M11)

Related Items (11)

Contracts as games on event structures ⋮ Session types and subtyping for orchestrated interactions ⋮ Reversible client/server interactions ⋮ Multiparty testing preorders ⋮ Orchestrated session compliance ⋮ Composition of synchronous communicating systems ⋮ On Composing Communicating Systems ⋮ An algebraic theory for web service contracts ⋮ Sub-behaviour relations for session-based client/server systems ⋮ Modelling session types using contracts ⋮ Consistently-detecting monitors

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• Failure-free coordinators synthesis for component-based architectures
• Fundamental properties of infinite trees
• Testing equivalences for processes
• Nondeterministic regular expressions as solutions of equational systems.
• Trace and testing equivalence on asynchronous processes
• Testing equivalence as a bisimulation equivalence
• Subtyping for session types in the pi calculus
• A theory of contracts for web services
• The Pairing of Contracts and Session Types
• The Must Preorder Revisited
• Contract-Directed Synthesis of Simple Orchestrators
• A characterization of regular expressions under bisimulation
• Acceptance trees
• Retrieving library functions by unifying types modulo linear isomorphism
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Contract-based discovery of Web services modulo simple orchestrators