Responsiveness of interoperating components

Formal Aspects of Computing

Volumn 16, Issue 4, 2004, Pages 394-411

  Reed, J N ^a   Sinclair, Jane E ^b   Roscoe, A W ^c  

^a Armstrong State University   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Component based systems; CSP; Deadlock; Refinement; Responsiveness

Indexed keywords

COMPUTER SYSTEM RECOVERY; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; LIFE CYCLE; MATHEMATICAL MODELS; MIDDLEWARE; SEMANTICS; SET THEORY; SYNCHRONIZATION;

COMPONENT-BASED SYSTEMS; CSP; DEADLOCK; REFINEMENT; RESPONSIVENESS;

INTEROPERABILITY;

EID: 10644285676     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-004-0050-9     Document Type: Article

References (22)

1. [Abr96] Abrial J-R (1996) The B-Book. Cambridge University Press, London
2. [AENT01] Nina Amla E, Emerson A, Namjoshi K, Trefler R (2001) Assume-guarantee based compositional reasoning for synchronous timing diagrams. Led Notes Comput Sci 2031:465+
3. [Ars02] Arsanjani A (2002) Developing and integrating enterprise components and services. Commun ACM 45(10)
4. [BL03] Bolton C, Lowe G (2003) On the automatic verification of non-standard measures of consistency. In: 6th international workshop in formal methods Dublin
5. [BR8S] Brookes SD, Roscoe AW (1985) Deadlock analysis in networks of communicating processes. In: Apt KR (ed) Logics and models of concurrent systems, NATO ASI vol 13 Ser F, Springer, Berlin Heidelberg New York pp 305-324
6. [But99] Butler MJ (1999) csp2b: A practical approach to combining CSP and B. In: Wing JM, Woodcock J, Davies J (eds) Proceedings of FM99: world congress on formal methods in the development of computing systems, vol 1. Springer, Berlin Heidelberg New York, pp 490-508
7. [But02] Butler M (2002) On the use of data refinement in the development of secure communications systems. Formal Aspects Comput Sci 14:2-34
8. [CHJK02] Crnkovic I, Hnich B, Jonsson T, Kisiltan, Z (2002) Specification, implementation, and deployment of components. Commun ACM 45(10)
9. [CSW02] Cavalcanti A, Sampaio A, Woodcock J (2002) Refinement of actions in Circus. In: Electronic notes in theoretical computer science, vol 70:3. Elsevier, REFINE 2002
10. [Dij76] Dijkstra EW (1976) A discipline of programming. Prentice Hall
11. [For] Formal Systems (Europe) Ltd. Failures divergence refinement. User manual and tutorial, http://www.formal.demon.co.uk/ fdr2manual/index.html
12. [Hoa85] Hoare, CAR (1985) Communicating sequential processes. Prentice Hall, Englewood Cliffs
13. [Int] Internet. MasterCraft integrated development framework for distributed applications. Tata Consultancy Services. http://www.tcs.com/ 0_products/mastercraft/index.htm
14. [Laz99] Lazić RS (1999) A semantic study of data independence with applications to model checking. DPhil Thesis, Oxford University Computing Laboratory
15. [Mor90] Morgan CC (1990) Of wp and CSP. In: Gries D, Feijen WHJ, van Gasteren AGM, Misra J (eds) Beauty is our business: a birthday salute to Edsger W. Dijkstra. Springer, Berlin Heidelberg New York
16. [RD87] Roscoe AW, Dathi N (1987) The pursuit of deadlock freedom. Inform Comput 75(3):289-327
17. [Ros98] Roscoe AW (1998) The theory and practice of concurrency. Prentice-Hall, Engelwood Cliffs
18. [Ros03] Roscoe AW (2003) On the expressiveness of CSP refinement checking
19. [RS01a] Reed JN, Sinclair JE (2001) Combining action systems and CSP: Plug-in specifications view. Electronic Notes Theor Comput Sci 40
20. [RS01b] Reed JN, Sinclair, JE (2001) Compatibility conditions for combining independent specifications. In: FASE 2001, fundamental approaches to software engineering, Genoa, Springer, pp 45-59
21. [TS99] Treharne H, Schneider S Using a process algebra to control B operations. In: Araki K, Galloway A, Taguchi K (eds) Integated Formal Methods 1999, Springer, Berlin Heidelberg New York, pp 437-456
22. [TS00] Treharne H, Schneider S (2000) How to drive a B machine. In: Bowen JP, Dunne S, Galloway A, King S (eds) In: Proceedings of ZB2000, Lecture Notes in Computer Science vol 1878, Springer, Berlin Heidelberg New York, pp 188-209