Timewise Reenement for Communicating Processes

A theory of timewise reenement is presented. This allows the translation of speciications and proofs of correctness between semantic models, permitting each stage in the veriication of a system to take place at the appropriate level of abstraction. The theory is presented within the context of CSP. A denotational characterisation of reenement is given in terms of relations between behaviours at diierent levels of abstraction. Various properties for the preservation of reenement through parallel composition are discussed. An operational characterisation is also given in terms of timed and untimed tests, and observed to coincide with the denotational characterisation.

[1]  Nancy G. Leveson,et al.  Safety Analysis Using Petri Nets , 1987, IEEE Transactions on Software Engineering.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  Tommaso Bolognesi,et al.  Timed Process Algebras with Urgent Interactions and a Unique Powerful Binary Operator , 1991, REX Workshop.

[4]  Janusz Zalewski,et al.  Specification and proof in real-time CSP , 1996 .

[5]  Juan Quemada,et al.  Introduction of Quantitative Relative Time into LOTOS , 1987, PSTV.

[6]  A. W. Roscoe,et al.  A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..

[7]  Steve A. Schneider,et al.  An Operational Semantics for Timed CSP , 1995, Inf. Comput..

[8]  Gavin Lowe.  Relating the Prioritized Model of Timed CSP to the Timed Failures Model , 1983 .

[9]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[10]  G. M. Reed.  A uniform mathematical theory for real-time distributed computingT , 1988 .

[11]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[12]  Wang Yi,et al.  Time-abstracted Bisimulation: Implicit Specifications and Decidability , 1997, Inf. Comput..

[13]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[14]  A. W. Roscoe,et al.  Fixed Points Without Completeness , 1995, Theor. Comput. Sci..

[15]  Jim Davies,et al.  A Brief History of Timed CSP , 1995, Theor. Comput. Sci..

[16]  Steven A. Schneider,et al.  Correctness and communication in real-time systems (tcsp) , 1989 .

[17]  Rance Cleaveland,et al.  A theory of testing for real-time , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.