2018-01-17T12:23:04Z EPrints http://deploy-eprints.ecs.soton.ac.uk/images/sitelogo.gif http://deploy-eprints.ecs.soton.ac.uk/ 2013-11-20T12:45:52Z 2013-11-20T12:45:52Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/464 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/464 2013-11-20T12:45:52Z

This model proves correct the optimisation implemented in Rodin 3.0 for storing the mathematical language in which proofs are written. See http://wiki.event-b.org/index.php/Language_of_an_Event-B_Component for more details on the context of this model.

Laurent Voisin laurent.voisin@systerel.fr 2012-06-29T07:55:23Z 2012-06-29T07:55:23Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/411 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/411 2012-06-29T07:55:23Z Anton Tarasyuk Anton.Tarasyuk@abo.fi Inna Pereverzeva Inna.Pereverzeva@abo.fi Elena Troubitsyna Elena.Troubitsyna@abo.fi Timo Latvala Laura Nummila 2012-06-29T07:55:06Z 2012-06-29T07:55:06Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/409 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/409 2012-06-29T07:55:06Z Inna Pereverzeva Inna.Pereverzeva@abo.fi Elena Troubitsyna Elena.Troubitsyna@abo.fi Linas Laibinis Linas.Laibinis@abo.fi 2012-06-29T07:54:52Z 2012-06-29T07:54:52Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/408 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/408 2012-06-29T07:54:52Z

Goal-Oriented Development facilitates structuring complex requirements. To ensure resilience the designers should guarantee that the system achieves its goals despite changes, e.g., caused by failures of system components. In this paper we propose a formal goal-oriented approach to development of resilient MAS. We formalize the notion of goal and goal achievement in Event-B and propose the specification and refinement patterns that allow us to guarantee that the targeted goals are reached despite agent failures. We illustrate our approach by a case study – development of an autonomous multi-robotic system.

Inna Pereverzeva Inna.Pereverzeva@abo.fi Elena Troubitsyna Elena.Troubitsyna@abo.fi Linas Laibinis Linas.Laibinis@abo.fi 2012-06-29T07:54:42Z 2012-06-29T07:54:42Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/407 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/407 2012-06-29T07:54:42Z

Modelling and refinement in Event-B provides a scalable sup- port for the development of complex service-oriented systems. Refinement in Event-B supports a systematic service development by a gradual trans- formation of an abstract specification into a detailed service architecture. In this paper we aim at integrating quantitative assessment of desired quality of essential service attributes into formal modelling process. We propose an approach to creating and verifying a dynamic service architecture in Event- B. Such an architecture can be augmented with stochastic information and transformed into the corresponding continuous-time Markov chain represen- tation. By relying on probabilistic model-checking techniques, we allow for quantitative evaluation of quality of service attributes at early development stages. The approach is illustrated by a simple case study.

Anton Tarasyuk Anton.Tarasyuk@abo.fi Elena Troubitsyna Elena.Troubitsyna@abo.fi Linas Laibinis Linas.Laibinis@abo.fi 2012-01-23T13:10:15Z 2012-01-23T13:10:15Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/363 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/363 2012-01-23T13:10:15Z

Consensus problems arise in any area of computing where distributed processes must come to a joint decision. Although solutions to consensus problems have similar aims, they vary according to the processor faults and network properties that must be taken into account, and modifying these assumptions will lead to different algorithms. Reasoning about consensus protocols is subtle, and correctness proofs are often informal. This paper gives a fully formal development and proof of a known consensus algorithm using the stepwise refinement method Event-B. This allows us to manage the complexity of the proof process by factoring the proof of correctness into a number of refinement steps, and to carry out the proof task concurrently with the development. During the development the processor faults and network properties on which the development steps rely are identified. The research outlined here is motivated by the observation that making different choices at these points may lead to alternative algorithms and proofs, leading to a refinement tree of algorithms with partially shared proofs.

Jeremy W. Bryans jeremy.bryans@ncl.ac.uk 2011-04-12T12:33:22Z 2011-04-12T12:54:29Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/298 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/298 2011-04-12T12:33:22Z

Dynamic virtual organisations (VOs) can arise in situations in which it is critical that they continue to operate, even in sub-optimal environments. Models of information flow in dynamic VOs are therefore needed in order to permit the rigorous verification of resilience properties before commitments are made to implementation. This paper proposes a refinement-based modelling approach for the design and analysis of VO policy resilience. The approach is demonstrated by using the refinement-based formalism Event-B to model a VO structure, commonly referred to as the Bronze/Silver/Gold structure that commonly arises in multi-agency response to emergencies. Machine-assisted proof is used to compare the validity of alternative information flow policies in Bronze/Silver/Gold when a fault is induced in the VO structure.

Jeremy W. Bryans jeremy.bryans@ncl.ac.uk John S. Fitzgerald john.fitzgerald@ncl.ac.uk Tom McCutcheon 2011-02-24T08:47:41Z 2011-02-24T08:47:41Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/292 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/292 2011-02-24T08:47:41Z Asieh Salehi Fathabadi Abdolbaghi Rezazadeh Michael Butler 2012-06-29T07:54:19Z 2012-06-29T07:54:19Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/405 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/405 2012-06-29T07:54:19Z

Modes are widely used to structure the behaviour of control systems. For many such systems, derivation and verification of a mode logic is challenging due to a large number of modes and complex mode transitions. In this paper we propose an approach to deriving, formalising and verifying consistency of a mode logic for fault tolerant control systems. We demonstrate how to use Failure Modes and Effects Analysis (FMEA) to systematically derive the fault tolerance part of the mode logic. To tackle the problem of mode consistency, we propose a formalisation of the mode logic and mode consistency conditions for layered systems with reconfigurable components. We use our formalisation to develop and verify a mode-rich system by refinement in Event-B.

Yuliya Prokhorova Yuliya.Prokhorova@abo.fi Linas Laibinis Linas.Laibinis@abo.fi Elena Troubitsyna Elena.Troubitsyna@abo.fi Kimmo Varpaaniemi Timo Latvala 2012-06-29T07:53:39Z 2012-06-29T07:53:39Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/404 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/404 2012-06-29T07:53:39Z

Application of formal methods, in particular Event-B, helps us to build control systems correct by construction. On the other hand, to guarantee safety of such a system, we need to incorporate safety and fault tolerance requirements into its formal specification. In this chapter, we demonstrate how to integrate the results obtained during fault analysis, specifically, failure mode and effect analysis (FMEA), into the control system development process in Event-B. The proposed methodology is exemplified by a case study.

Yuliya Prokhorova Yuliya.Prokhorova@abo.fi Elena Troubitsyna Elena.Troubitsyna@abo.fi Linas Laibinis Linas.Laibinis@abo.fi Vyacheslav Kharchenko 2012-07-23T12:29:58Z 2012-07-23T12:29:58Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/444 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/444 2012-07-23T12:29:58Z

UML-B is a `UML like' notation based on the Event-B formalism which allows models to be progressively detailed through refinements that are proven to be consistent and to satisfy safety invariants using the Rodin platform and its automatic proof tools. UML, on the other hand, encourages large models to be expressed in a single, detailed level and relies on simulation and model testing techniques for verification. The advantage of proof over model-testing is that the proof is valid for all instantiations of the model whereas a simulation must choose a typical instantiation. In the INESS project we take an extant UML model of a railway interlocking system and explore methodical ways to translate it into UML-B in such a way as to facilitate proof that the model satisfies certain safety properties which are expressed as invariants. We describe the translation attempted so far and insights that we have gained from attempting to prove a safety property. We propose some possible improvements to the translation which we believe will make the proof easier.

Colin Snook Vitaly Savicks Michael Butler 2011-02-16T14:27:09Z 2011-02-18T15:29:14Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/285 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/285 2011-02-16T14:27:09Z

We give a formal development and proof of a known consensus algorithm using stepwise refinement. We begin with an abstract specification of the intended result of the algorithm. The algorithm is developed and proved correct over a number of refinement steps. The proof of correctness is performed concurrently with the development. The development and proof make use of key fault and failure assumptions. The stepwise refinement approach allows us to introduce and prove each property at the most appropriate stage in the development, before detail irrelevant to that property has been added to the model. Finally we introduce an abstract model of a possible network on which the algorithm could be executed.

Jeremy W. Bryans jeremy.bryans@ncl.ac.uk 2010-03-08T17:12:38Z 2010-04-19T15:06:00Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/209 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/209 2010-03-08T17:12:38Z Sanaz Yeganefard Michael Butler Abdolbaghi Rezazadeh 2010-02-05T09:55:00Z 2010-02-05T09:55:00Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/203 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/203 2010-02-05T09:55:00Z

We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges in developing this algorithm is specifying the problem itself. We provide a specification that includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We prove these properties by appropriately combining proofs of invariants, event refinement, event convergence, and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment. Our entire development has been formalized and machine checked using the Rodin tool.

Thai Son Hoang htson@inf.ethz.ch Hironobu Kuruma David Basin basin@inf.ethz.ch Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-07-21T14:14:31Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/137 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/137 2009-07-21T14:14:31Z Michael Butler mjb@ecs.soton.ac.uk Stefan Hallerstede Laurent Voisin 2009-06-06T10:51:41Z 2010-04-19T15:05:53Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/84 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/84 2009-06-06T10:51:41Z

MIDAS (Microprocessor Instruction and Data Abstraction System) is a specification of an Instruction Set Architecture (ISA) capable of executing binary images compiled from the C language. It was developed to demonstrate a methodology for formal construction of various ISAs in Event-B via a generic model. It is intended to be representative of typical microprocessor ISAs, but using a minimal number of defined instructions, in order to make complete refinement practical. The intention is to simplify the number and complexity of the defined instructions at the cost of compiler complexity, run-time performance and code density, without compromising representativeness. There are two variants: a stack-based machine and a randomly accessible register array machine. The two variants employ the same instruction codes, the differences being limited to register file behavior.

Stephen Wright stephen.wright@bris.ac.uk 2009-05-28T15:30:52Z 2010-04-19T15:05:54Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/107 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/107 2009-05-28T15:30:52Z

In this paper we outline some on-going research on approximating continuous behaviour in Event-B in order to model and reason about a control system. We make a distinction between a control goal and a control strategy. We outline how both can be modelled and how refinement can be used to prove that a strategy satisfies a goal.

Michael Butler mjb@ecs.soton.ac.uk 2010-02-05T10:35:54Z 2010-02-05T10:35:54Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/205 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/205 2010-02-05T10:35:54Z

We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges is specifying the problem itself. Our specification includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We establish these by appropriately combining proofs of invariant preservation, event refinement, event convergence, and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment.

Thai Son Hoang htson@inf.ethz.ch Hironobu Kuruma David Basin basin@inf.ethz.ch Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-02-11T15:00:58Z 2010-04-19T15:05:53Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/82 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/82 2009-02-11T15:00:58Z Thai Son Hoang htson@inf.ethz.ch David Basin basin@inf.ethz.ch Hironobu Kuruma Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-05-28T16:20:05Z 2010-04-19T15:05:54Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/108 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/108 2009-05-28T16:20:05Z Michael Butler mjb@ecs.soton.ac.uk 2008-12-18T14:43:04Z 2010-04-19T15:05:51Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/52 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/52 2008-12-18T14:43:04Z

Distributed information systems are critical to the functioning of many businesses; designing them to be dependable is a challenging but important task. We report our experience in using formal methods to enhance processes and tools for development of business information software based on service-oriented architectures. In our work, which takes place in an industrial setting, we focus on the configuration of middleware, verifying application-level requirements in the presence of faults. In pilot studies provided by SAP, we used the Event-B formalism and the open RODIN tools platform to prove properties of models of business protocols and expose weaknesses of certain middleware configurations with respect to particular protocols. We then extended the approach to use models automatically generated from diagrammatic design tools, opening the possibility of seamless integration with current development environments. Increased automation in the verification process, through domain-specific models and theories, is a goal for future work.

Jeremy W. Bryans jeremy.bryans@ncl.ac.uk John S. Fitzgerald john.fitzgerald@ncl.ac.uk Romanovsky Alexander alexander.romanovsky@ncl.ac.uk Roth Andreas andreas.roth@sap.com 2008-08-20T10:08:47Z 2010-04-19T15:05:50Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/31 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/31 2008-08-20T10:08:47Z Thai Son Hoang htson@inf.ethz.ch David Basin basin@inf.ethz.ch Hironobu Kuruma Jean-Raymond Abrial jabrial@inf.ethz.ch 2008-04-21T14:57:03Z 2010-04-19T15:05:49Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/22 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/22 2008-04-21T14:57:03Z Kriangsak Damchoom Michael Butler Jean-Raymond Abrial 2008-12-25T13:13:18Z 2010-04-19T15:05:51Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/55 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/55 2008-12-25T13:13:18Z Jean-Raymond Abrial jabrial@inf.ethz.ch Thai Son Hoang htson@inf.ethz.ch Matthias Schmalz matthias.schmalz@inf.ethz.ch 2008-12-25T13:01:55Z 2010-04-19T15:05:51Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/54 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/54 2008-12-25T13:01:55Z Jean-Raymond Abrial jabrial@inf.ethz.ch Thai Son Hoang htson@inf.ethz.ch Matthias Schmalz matthias.schmalz@inf.ethz.ch 2008-12-25T13:23:20Z 2010-04-19T15:05:52Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/56 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/56 2008-12-25T13:23:20Z Jean-Raymond Abrial jabrial@inf.ethz.ch Thai Son Hoang htson@inf.ethz.ch Matthias Schmalz matthias.schmalz@inf.ethz.ch 2008-12-25T12:17:34Z 2010-04-19T15:05:51Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/53 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/53 2008-12-25T12:17:34Z Jean-Raymond Abrial jabrial@inf.ethz.ch Thai Son Hoang htson@inf.ethz.ch Matthias Schmalz matthias.schmalz@inf.ethz.ch 2008-10-07T21:30:15Z 2008-10-07T21:30:15Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/38 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/38 2008-10-07T21:30:15Z Michael Butler Divakar Yadav 2008-01-07T11:30:06Z 2010-04-19T15:05:49Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/9 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/9 2008-01-07T11:30:06Z

CDIS is a commercial air traffic information system that was developed using formal methods 15 years ago by Praxis, and it is still in operation today. This system is an example of an industrial scale system that has been developed using formal methods. In particular, the functional requirements of the system were specified using VVSL -- a variant of VDM. A subset of the original specification has been chosen to be reconstructed on the Rodin platform based on the new Event-B formalism. The goal of our reconstruction was to overcome three key difficulties of the original formalisation, namely the difficulty of comprehending the original specification, the lack of any mechanical proof of the consistency of the specification and the difficulty of dealing with distribution and atomicity refinement. In this paper we elucidate how a new formal notation and tool can help to overcome these difficulties.

Abdolbaghi Rezazadeh Michael Butler Neil Evans 2008-02-12T22:08:33Z 2010-04-19T15:05:49Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/10 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/10 2008-02-12T22:08:33Z Jean-Raymond Abrial 2012-02-20T11:14:03Z 2012-02-20T11:14:03Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/371 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/371 2012-02-20T11:14:03Z Thai Son Hoang htson@inf.ethz.ch 2011-09-27T12:02:46Z 2011-09-27T12:02:46Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/346 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/346 2011-09-27T12:02:46Z

The XCore microprocessor is an embedded device developed by XMOS Ltd of Bristol, UK. The processor is general-purpose and has therefore been deployed in a range of different markets, including audio, display, communications, robotics and motor control. The technology is re-used in multiple products, including the XS1-G4 (a four-core device that can run up to 32 real time tasks), and the XS1-L1 (a single core device that can run up to 8 real time tasks). The ISA contains a range of typical instructions such as control-flow, register-to-register calculation and memory access, but also provides support for efficient synchronized multi-threaded programming and parallelism with other devices via fast interconnects. Support for these features is integrated into the ISA of the XCore, in contrast to a conventional memory-mapped device approach. This greatly improves run-time performance, at the cost of introducing specialist instructions to the ISA, which comprises 176 instructions. As part of a Bristol University Knowledge Transfer Secondment (KTS) (Grant EP/H500316/1), a formal model of the complete ISA was constructed in Event-B, using the Rodin toolset. This project applied and extended the Event-B and RODIN based techniques for Instruction Set Architecture (ISA) analysis, developed by Dr Stephen Wright during his doctoral research, to an industrial setting. To that end, XMOS Ltd hosted Dr Wright in the period October 2010 to October 2011.

Stephen Wright stephen.wright@bris.ac.uk 2009-06-19T16:08:23Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/113 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/113 2009-06-19T16:08:23Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-07-23T13:27:49Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/139 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/139 2009-07-23T13:27:49Z Carine Pascal 2010-08-19T10:18:37Z 2010-08-26T16:20:06Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/243 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/243 2010-08-19T10:18:37Z Kriangsak Damchoom kd06r@ecs.soton.ac.uk 2009-06-19T17:28:00Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/116 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/116 2009-06-19T17:28:00Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-19T15:56:56Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/112 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/112 2009-06-19T15:56:56Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2011-05-27T20:31:17Z 2011-05-27T20:31:17Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/308 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/308 2011-05-27T20:31:17Z Simon Hudon Thai Son Hoang htson@inf.ethz.ch 2010-06-14T10:29:35Z 2010-06-14T10:29:35Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/230 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/230 2010-06-14T10:29:35Z Thai Son Hoang htson@inf.ethz.ch 2010-12-01T11:08:34Z 2010-12-09T15:37:25Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/258 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/258 2010-12-01T11:08:34Z

The paper reports our investigation on tool support for the integration of qualitative probabilistic reasoning into Event-B. In the process, we formalise a non-trivial algorithm, namely Rabin's choice coordination. Our correctness reasoning is a combination of termination proofs in terms of probabilistic convergence and standard invariant techniques. Moreover, we describe how qualitative probabilistic reasoning can be maintained during refinement.

Emre Yilmaz Thai Son Hoang htson@inf.ethz.ch 2011-02-16T14:27:02Z 2011-02-16T14:27:02Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/286 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/286 2011-02-16T14:27:02Z

Associated with and described in archive number 285

Jeremy W. Bryans jeremy.bryans@ncl.ac.uk 2009-07-22T17:23:07Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/138 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/138 2009-07-22T17:23:07Z

Proof of Well-ordering theorem in Rodin

Jean-Raymond Abrial 2011-11-23T15:44:42Z 2011-11-23T15:44:42Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/357 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/357 2011-11-23T15:44:42Z

For Rodin 2.3.0 and Qualitative Probability plug-in 0.2.1

Thai Son Hoang htson@inf.ethz.ch 2009-06-19T18:05:34Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/117 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/117 2009-06-19T18:05:34Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-29T16:31:12Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/128 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/128 2009-06-29T16:31:12Z Thai Son Hoang htson@inf.ethz.ch 2009-06-29T16:38:40Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/129 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/129 2009-06-29T16:38:40Z Andreas Fürst afuerst@student.ethz.ch 2009-06-19T17:18:52Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/114 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/114 2009-06-19T17:18:52Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2010-03-04T16:27:05Z 2010-04-19T15:06:00Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/208 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/208 2010-03-04T16:27:05Z Thai Son Hoang htson@inf.ethz.ch 2011-11-23T15:48:11Z 2011-11-23T15:48:11Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/359 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/359 2011-11-23T15:48:11Z

For Rodin 2.3.0 and Qualitative Probability plug-in 0.2.1

Thai Son Hoang htson@inf.ethz.ch 2009-06-19T18:10:25Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/118 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/118 2009-06-19T18:10:25Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-19T19:13:19Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/123 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/123 2009-06-19T19:13:19Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2010-07-06T10:18:59Z 2010-07-19T15:19:36Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/234 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/234 2010-07-06T10:18:59Z Thai Son Hoang htson@inf.ethz.ch 2011-04-12T13:01:33Z 2011-04-12T13:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/300 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/300 2011-04-12T13:01:33Z Jeremy W. Bryans jeremy.bryans@ncl.ac.uk 2011-04-12T13:04:50Z 2011-04-12T13:04:50Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/301 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/301 2011-04-12T13:04:50Z Jeremy W. Bryans jeremy.bryans@ncl.ac.uk 2009-06-19T18:17:27Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/120 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/120 2009-06-19T18:17:27Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-19T19:10:48Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/122 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/122 2009-06-19T19:10:48Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2010-04-06T16:23:57Z 2010-04-19T15:06:01Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/215 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/215 2010-04-06T16:23:57Z Thai Son Hoang htson@inf.ethz.ch 2009-06-19T18:14:08Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/119 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/119 2009-06-19T18:14:08Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-19T17:22:23Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/115 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/115 2009-06-19T17:22:23Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-19T18:20:25Z 2010-04-19T15:05:55Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/121 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/121 2009-06-19T18:20:25Z Jean-Raymond Abrial jabrial@inf.ethz.ch 2009-06-19T19:15:32Z 2010-04-19T15:05:56Z http://deploy-eprints.ecs.soton.ac.uk/id/eprint/124 This item is in the repository with the URL: http://deploy-eprints.ecs.soton.ac.uk/id/eprint/124 2009-06-19T19:15:32Z Jean-Raymond Abrial jabrial@inf.ethz.ch