Timewise refinement for communicating processes

Science of Computer Programming

Volumn 28, Issue 1, 1997, Pages 43-90

  Schneider, Steve ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Concurrency; Real time systems; Refinement; Timed CSP; Timewise refinement; Verification

Indexed keywords

COMPUTER AIDED LANGUAGE TRANSLATION; COMPUTER SOFTWARE PORTABILITY; CONCURRENCY CONTROL; MATHEMATICAL MODELS;

DENOTATIONAL CHARACTERIZATION; OPERATIONAL CHARACTERIZATION; PARALLEL COMPOSITION; TIMEWISE REFINEMENT;

REAL TIME SYSTEMS;

EID: 0030781562     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-6423(96)00016-0     Document Type: Article

References (31)

1. J.C.M. Baeten and J.A. Bergstra, Discrete time process algebra, University of Amsterdam, Report P9208b, 1992.
2. T. Bolognesi and F. Lucidi, Timed process algebras with urgent interactions and a unique powerful binary operator, Lecture Notes in Computer Science, Vol. 600 (Springer, Berlin, 1992).
3. S.D. Brookes and A.W. Roscoe, An improved failures model for communicating sequential processes, Proc. Seminar on Concurrency, Lecture Notes in Computer Science, Vol. 197 (Springer, Berlin, 1985).
4. S.D. Brookes, A.W. Roscoe and D.J. Walker, An operational semantics for CSP, submitted for publication, 1992.
5. R. Cleaveland and A.E. Zwarico, A Theory of Testing for Real-time (North Carolina SU and Johns Hopkins, 1992).
6. J.W. Davies, Specification and Proof in Real-time CSP (Cambridge Univ. Press Cambidge, 1993).
7. J.W. Davies, D.M. Jackson and S.A. Schneider, Making things happen in Timed CSP, PRG Tech. Report 2-90, Oxford, 1990.
8. J.W. Davies and S.A. Schneider, Recursion induction for real-time processes, Formal Aspects of Comput. 5 (6) (1993).
9. J.W. Davies and S.A. Schneider, A brief history of timed CSP, Theoret. Comput. Sci. 138 (1995).
10. Formal Systems (Europe) Ltd., The Failures Divergences Refinement User Manual, 1993.
11. R. Gerth, R. Kuiper and J. Segers, Interface refinement in reactive systems, Proc. CONCUR '92, Lecture Notes in Computer Science, Vol. 630 (Springer, Berlin, 1992).
12. M. Hennessy, Algebraic Theory of Processes (MIT Press, Cambridge, 1988).
13. C.A.R. Hoare, Communicating Sequential Processes (Prentice-Hall, Englewood Cliffs, NJ, 1985).
14. K.G. Larsen and Wang Yi, Time abstracted bisimulation: implicit specifications and decidability, Proc. MFPS '93, Lecture Notes in Computer Science Vol. 802 (Springer, Berlin, 1993).
15. N.G. Leveson and J.L. Stolzy, Safety analysis using Petri nets, IEEE Trans. Software Engineering, (1987).
16. G. Lowe, Prioritized and probabilistic models of timed CSP, Oxford University Computing Laboratory Tech. Report PRG-TR-24-91, 1991.
17. G. Lowe, Relating the Prioritized Model of Timed CSP to the Timed Failures Model (Oxford University Computing Laboratory, Oxford, 1992).
18. N. Lynch and F. Vaandrager, Forward and backward simulations for timing based systems, in: Proc. Real-time: Theory in Practise, Lecture Notes in Computer Science, Vol. 600 (Springer, Berlin, 1992).
19. R. Milner, Communication and Concurrency (Prentice-Hall, Englewood Cliffs, NJ, 1989).
20. M.W. Mislove, A.W. Roscoe and S.A. Schneider, Fixed points without completeness, Theoret. Comput. Sci. 138 (1995).
21. J. Quemada and A. Fernandez, Introduction of quantitative relative time into LOTOS, in: Protocol Specification, Testing and Verification VII (North-Holland, Amsterdam, 1987).
22. G.M. Reed, A uniform mathematical theory for real-time distributed computing, Oxford University DPhil Thesis, 1988.
23. G.M. Reed and A.W. Roscoe, A timed model for communicating sequential processes, Proc. 13th ICALP, Lecture Notes in Computer Science, Vol. 226 (Springer, Berlin, 1986).
24. A.W. Roscoe, Unbounded Nondeterminism in CSP, Oxford University Computing Laboratory. Tech. monograph PRG-67, 1988.
25. A.W. Roscoe, Model-checking CSP, in: A.W. Roscoe, ed., A Classical Mind (Prentice-Hall, Englewood Cliffs, NJ, 1994).
26. S.A. Schneider, correctness and communication in real-time systems, Oxford University DPhil. Thesis 1989.
27. S.A. Schneider, An operational semantics for timed CSP, Proc. Workshop on Concurrency, Report 63, Programming Methodology Group, Chalmers University, 1992.
28. S.A. Schneider, Unbounded nondeterminism for real-time processes, Oxford University Tech. Report 13-92, 1992.
29. S.A. Schneider, An operational semantics for timed CSP, Inform. Comput. 116 (1995).
30. S.A. Schneider, Specification and verification in Timed CSP, in: Real-time Systems: Specification, Verification and Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1996).
31. Wang Yi, Real-time behaviour of asynchronous agents, Proc. CONCUR '90, Lecture Notes in Computer Science, Vol. 458 (Springer, Berlin, 1990).