Using coupled simulations in non-atomic refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2651, Issue , 2003, Pages 127-147

  Derrick, John ^a   Wehrheim, Heike ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

Action refinement; Coupled simulations; Non atomic refinement; Z

Indexed keywords

ATOMS; SPECIFICATIONS;

ABSTRACT LEVELS; ABSTRACT SPECIFICATIONS; ACTION REFINEMENT; CONCRETE SYSTEM; COUPLED SIMULATION; COUPLING CONDITION; NON-ATOMIC REFINEMENT; SIMULATION RELATION;

CONCRETES;

EID: 35248820617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44880-2_10     Document Type: Article

References (22)

1. J.-R. Abrial. The B-Book: Assigning Programs to Meanings. CUP, 1996.
2. L. Aceto. Action Refinement in Process Algebras. CUP, London, 1992.
3. L. Aceto and M. Hennessy. Towards action-refinement in process algebras. Information and Computation, 103:204-269, 1993.
4. E. A. Boiten and J. Derrick. IO-refinement in Z. In A. Evans, D. J. Duke, and T. Clark, editors, 3rd BCS-FACS Northern Formal Methods Workshop. Springer-Verlag, September 1998. http://www.ewic.org.uk/.
5. W.-P. de Roever and K. Engelhardt. Data Refinement: Model-Oriented Proof Methods and their Comparison. CUP, 1998.
6. J. Derrick and E. Boiten. Non-atomic refinement in Z. In J. Woodcock and J. Wing, editors, FM'99, World Congress on Formal Methods, number 1709 in LNCS, pages 1477-1496. Springer, 1999.
7. J. Derrick and E. A. Boiten. Refinement in Z and Object-Z. Springer-Verlag, 2001.
8. C. Fischer. CSP-OZ - a combination of CSP and Object-Z. In H. Bowman and J. Derrick, editors, Second IFIP International conference on Formal Methods for Open Object-based Distributed Systems, pages 423-438. Chapman & Hall, July 1997.
9. C. Fischer. How to combine Z with a process algebra. In ZUM'98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science, pages 5-23. Springer-Verlag, September 1998.
10. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.
11. C. B. Jones. Systematic Software Development using VDM. Prentice Hall, 1989.
12. J. Parrow and P. Sjödin. Multiway Synchronisation Verified with Coupled Simulation. In R. Cleaveland, editor, CONCUR '92, Concurrency Theory, number 630 in LNCS, pages 518-533. Springer, 1992.
13. A. Rensink. Action Contraction. In C. Palamidessi, editor, CONCUR 2000 - Concurrency Theory, number 1877 in LNCS, pages 290-304. Springer, 2000.
14. A. Rensink and R. Gorrieri. Action refinement as an implementation relation. In M. Bidoit and M. Dauchet, editors, TAPSOFT '97: Theory and Practice of Software Development, volume 1214 of Lecture Notes in Computer Science, pages 772-786, 1997.
15. G. Smith. A semantic integration of Object-Z and CSP for the specification of concurrent systems. In J. Fitzgerald, C. B. Jones, and P. Lucas, editors, FME'97: Industrial Application and Strengthened Foundations of Formal Methods, volume 1313 of Lecture Notes in Computer Science, pages 62-81. Springer-Verlag, September 1997.
16. G. Smith and J. Derrick. Specification, refinement and verification of concurrent systems - an integration of Object-Z and CSP. Formal Methods in Systems Design, 18:249-284, May 2001.
17. J. M. Spivey. The Z Notation: A Reference Manual. International Series in Computer Science. Prentice Hall, 2nd edition, 1992.
18. S. Stepney, D. Cooper, and J. C. P. Woodcock. More powerful data refinement in Z. In J. P. Bowen, A. Fett, and M. G. Hinchey, editors, ZUM'98: The Z Formal Specification Notation, volume 1493 of Lecture Notes in Computer Science, pages 284-307. Springer-Verlag, September 1998.
19. H. Treharne and S. Schneider. Using a process algebra to control B operations. In K. Araki, A. Galloway, and K. Taguchi, editors, International Conference on Integrated Formal Methods 1999 (IFM'99), pages 437-456, York, July 1999. Springer.
20. R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In A. Kreczmar and G. Mirkowska, editors, Mathematical Foundations of Computer Science 1989, volume 379 of LNCS, pages 237-248. Springer, 1989.
21. Walter Vogler. Failure semantics based on interval semiwords is a congruence for refinement. Distributed Computing, 4:139-162, 1991.
22. J. C. P. Woodcock and J. Davies. Using Z: Specification, Refinement, and Proof. Prentice Hall, 1996.