Relating fair testing and accordance for service replaceability

DOI10.1016/J.JLAP.2009.12.001zbMath1208.68087OpenAlexW2129862753MaRDI QIDQ974133

Arjan J. Mooij, Marc Voorhoeve, Christian Stahl

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

formal methodsrefinementbehavioral equivalencesservice oriented computing

Mathematics Subject Classification ID

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

Related Items (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

Cites Work

• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• Refusal testing
• Fair testing
• Extensional equivalences for transition systems
• Testing equivalences for processes
• Contract Based Multi-party Service Composition
• The Must Preorder Revisited
• Does My Service Have Partners?
• Deciding Substitutability of Services with Operating Guidelines
• A Theory of Communicating Sequential Processes
• Process Algebra
• Divergence and fair testing
• Computer Aided Verification
• CONFLICTS AND FAIR TESTING
• Liveness, Fairness and Impossible Futures

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