Relating fair testing and accordance for service replaceability

Journal of Logic and Algebraic Programming

Volumn 79, Issue 3-5, 2010, Pages 233-244

  Mooij, Arjan J ^a   Stahl, Christian ^a,b   Voorhoeve, Marc ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Behavioral equivalences; Formal methods; Refinement; Service oriented computing

Indexed keywords

BEHAVIORAL EQUIVALENCE; BEHAVIORAL EQUIVALENCES; BRANCHING-TIME SPECTRUM; FAIR TESTING; NEW SERVICES; SERVICE ORIENTED COMPUTING; THEORETICAL RESULT;

FORMAL METHODS;

EID: 77952106439     PISSN: 15678326     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jlap.2009.12.001     Document Type: Article

References (25)

1. Baeten J., and Weijland W. Process Algebra (1990), Cambridge University Press
2. M. Bravetti, G. Zavattaro, Contract based multi-party service composition, in: FSEN'07, LNCS, vol. 4767, 2007, pp. 207-222.
3. M. Bravetti, G. Zavattaro, Contract compliance and choreography conformance in the presence of message queues, in: WS-FM'08, LNCS, vol. 5387, 2009, pp. 37-54.
4. E. Brinksma, A. Rensink, W. Vogler, Fair testing, in: CONCUR'95, LNCS, vol. 962, 1995, pp. 313-327.
5. Brookes S., Hoare C., and Roscoe A. A theory of communicating sequential processes. Journal of the ACM 31 3 (1984) 560-599
6. Boreale M., De Nicola R., and Pugliese R. Basic observables for processes. Information and Computation 149 (1999) 95-109
7. Castagna G., Gesbert N., and Padovani L. A theory of contracts for web services. ACM Transactions on Programming Languages and Systems 31 (2009)
8. E. Clarke, E. Emerson, Design and synthesis of synchronization skeletons using branching-time temporal logic, in: Logics of Programs '81, LNCS, vol. 131, 1982, pp. 52-71.
9. De Nicola R. Extensional equivalences for transition systems. Acta Informatica 24 2 (1987) 211-237
10. De Nicola R., and Hennessy M. Testing equivalences for processes. Theoretical Computer Science 34 (1984) 83-133
11. C. Fournet, T. Hoare, S. Rajamani, J. Rehof, Stuck-free conformance, in: CAV'04, LNCS, vol. 3114, 2004, pp. 242-254.
12. C. Laneve, L. Padovani, The must preorder revisited, in: CONCUR'07, LNCS, vol. 4703, 2007, pp. 212-225.
13. Malik R., Streader D., and Reeves S. Conflicts and fair testing. Journal of Foundations of Computer Science 17 4 (2006) 797-813
14. A. Mooij, M. Voorhoeve, Proof techniques for adapter generation, in: WS-FM'08, LNCS, vol. 5387, 2009, pp. 207-223.
15. V. Natarajan, R. Cleaveland, Divergence and fair testing, in: ICALP'95, LNCS, vol. 944, 1995, pp. 648-659.
16. Phillips I. Refusal testing. Theoretical Computer Science 50 (1987) 241-284
17. Rensink A., and Vogler W. Fair testing. Information and Computation 205 2 (2007) 125-198
18. Stahl C., Massuthe P., and Bretschneider J. Deciding substitutability of services with operating guidelines. LNCS ToPNoC 5460 II (2009) 172-191
19. van der Aalst W.M.P., Lohmann N., Massuthe P., Stahl C., and Wolf K. Multiparty contracts: Agreeing and implementing interorganizational processes. The Computer Journal 53 1 (2010) 90-106
20. R. van Glabbeek, The linear time-branching time spectrum II; the semantics of sequential processes with silent moves, in: CONCUR'93, LNCS, vol. 715, 1993, pp. 66-81.
21. R. van Glabbeek, The linear time-branching time spectrum I. The semantics of concrete, sequential processes, in: Handbook of Process Algebra, Elsevier, 2001, pp. 3-99.
22. R. van Glabbeek, M. Voorhoeve, Liveness, fairness and impossible futures, in: CONCUR'06, LNCS, vol. 4137, 2006, pp. 126-141.
23. W. Vogler, in: Modular Construction and Partial Order Semantics of Petri Nets, LNCS, vol. 625, Springer-Verlag, 1992.
24. K. Wolf, Does my service have partners? LNCS ToPNoC 5460 (II) (2009) 152-171.
25. K. Wolf, C. Stahl, J. Ott, R. Danitz, Verifying livelock freedom in an SOA scenario, in: ACSD'09, IEEE Computer Society, July 2009, pp. 168-177.