Relating fair testing and accordance for service replaceability

DOI10.1016/J.JLAP.2009.12.001MaRDI QIDQ974133zbMATH OpenOpenAlexFDO

Authors Arjan J. Mooij, Christian Stahl, Marc Voorhoeve

Publication date 27 May 2010

Published in The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlap.2009.12.001

zbMATH Keywords

behavioral equivalencesformal methodsrefinementservice oriented computing

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Deciding Substitutability of Services with Operating Guidelines
• A theory of contracts for strong service compliance
• A Net-based Approach to Web Services Publication and Replaceability
• Multiparty testing preorders
• Mutually testing processes

Cites work

• A Theory of Communicating Sequential Processes
• Computer Aided Verification
• CONFLICTS AND FAIR TESTING
• Contract Based Multi-party Service Composition
• Deciding Substitutability of Services with Operating Guidelines
• Divergence and fair testing
• Does My Service Have Partners?
• Extensional equivalences for transition systems
• Fair testing
• scientific article; zbMATH DE number 3870578 (Why is no real title available?)
• Liveness, Fairness and Impossible Futures
• Modular construction and partial order semantics of Petri nets
• Process Algebra
• Refusal testing
• Testing equivalences for processes
• The linear time -- branching time spectrum. I: The semantics of concrete, sequential processes.
• The Must Preorder Revisited

Cited in

(3)

• Undecidability of accordance for open systems with unbounded message queues
• Trace- and failure-based semantics for responsiveness
• Fair subtyping for multi-party session types

This page was built for publication: Relating fair testing and accordance for service replaceability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974133)