| Banach R., Poppleton M. Retrenchment, Refinement and Simulation. In Proc. ZB-00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer (2000). |
No context found.
Banach R., Poppleton M. Retrenchment, Refinement and Simulation. In Proc. ZB-00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer (2000).
No context found.
R. Banach and M. Poppleton. Retrenchment, refinement and simulation. In J. Bowen, S. King, S. Dunne, and A. Galloway, editors, Proc. ZB2000.
No context found.
Banach R., Poppleton M. Retrenchment, Refinement and Simulation. in: Proc. ZB-00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer (2000).
No context found.
Banach R., Poppleton M. Retrenchment, Refinement and Simulation. In Proc. ZB-00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer (2000).
No context found.
R. Banach and M. Poppleton. Retrenchment, refinement and simulation. In J. Bowen, S. King, S. Dunne, and A. Galloway, editors, Proc. ZB2000.
No context found.
Banach R., Poppleton M. (2000a); Retrenchment, Refinement and Simulation. in: Proc. ZB-00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer.
....abstract model that can be contracted to with confidence for further development. Not that they ever claimed to, but in the oversold and underused [6] atmosphere that has often surrounded debate about formal techniques in the past, it is easy to imagine that they might have done. Retrenchment [7, 8, 9, 10], is a technique that aims to help address this issue by providing a formalism in which the demanding proof obligations (POs) of refinement are weakened, so that models not refineable to the ultimate concrete system, but nevertheless considered useful, can be incorporated into the development in a ....
....combined into the retrenchment PO for steps which says that for each m A : G(u, v) P m (i, j, u, v) stp m C (v, j, v, p) u, o . stp m A (u, i, u, o) G(u, v) C m (u, v, o, p; i, j, u, v) 2. 2) This PO affords considerable flexibility in relating different levels of abstraction, see [7, 8, 9, 10] for a discussion. We consider a toy example, just to set the scene. The abridged level is given by an initialisation operation Init A , and one further operation Up A . We have U = 0, 3 , and I Up A = O Up A . Init A sets u to 0, and Up A is given by 0 (e, Up A , e) 3, where e is the ....
Banach R., Poppleton M. (2000); Retrenchment, Refinement and Simulation. in: Proc. ZB-00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer.
....[29] reported initial work, using transitivity and monotonicity arguments, on the development of a calculus of retrenchment in B. This calculus was completed in [31] which showed all primitive operators of the B GSL, including operation sequence, to be monotonic with respect to retrenchment. [8, 9] gave a substantial theoretical presentation and development of the retrenchment framework, exploring the landscape between refinement, simulation and retrenchment. This was done by means both of B and automata theoretic formalisms, using specialised (if widely applicable) further assumptions to ....
R. Banach and M. Poppleton. Retrenchment, refinement and simulation. In J. Bowen, S. King, S. Dunne, and A. Galloway, editors, Proc. ZB
....they hold equally for the before and after states of a transition, paraphrasing stepwise simulation into strong simulation becomes realistic, as happened in Section 2.3. And from stepwise simulation, deriving a semiconservative extension is easy. Some examples of these approaches can be found in [Banach and Poppleton (2000a) worked out for the B Method. The fact that an FNS state need not be terminal in the concrete transition system means that a concrete execution sequence may continue beyond the point at which it ceases to be simulable. This gives rise to the notion of punctured simulation, in which some but ....
....two succesive retrenchments compose vertically to make another retrenchment. This is but a first step in the integration of retrenchment with other specification constructors, particularly refinement, in order to build a complete algebraic theory, a task beyond the scope of this paper; see e.g. [Banach (2000), Banach et al. 2001a) We will deal with a sequence of systems Sys 0 , Sys 1 , and will assume that there is a retrenchment given by G d (u d 1 , u d ) P Op,d (i d 1 , i d , u d 1 , u d ) C Op,d (u d 1 , u d , o d 1 , o d ; i d 1 , i d , u d 1 , u d ) from the more abstract system ....
[Article contains additional citation context not shown here]
Banach R., Poppleton M. (2000a); Retrenchment, Refinement and Simulation. in: Proc. ZB00, Bowen, Dunne, Galloway, King (eds.), LNCS 1878, 304-323, Springer.
....in specification with retrenchment, the notion needs further specialisation. Being a very weak relation, retrenchment lends itself to application domain specific strengthening. We have introduced various such specialisations (modulated refinement, sharp and simple simulable retrenchment [BP99a, BP99b, BP00]) and here propose a notion of evolving retrenchment for use in simulation of continuous systems. The notion of an evolving relationship between system models emerges from the intrinsically approximate nature of modelling real world systems with continuous variables. For example, to model the ....
R. Banach and M. Poppleton. Retrenchment, refinement and simulation. 2000. submitted for publication.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC