Refinement-based development supported by Event-B has been extensively used in the domain of embedded and distributed systems design. For these domains timing analysis is of great importance. However, in its present form, Event-B does not have a built-in notion of time. The theory of refinement of timed transition systems has been studied, but a refinement-based design flow of these systems is weakly supported by industrial strength tools. In this paper, we focus on the refinement relation in the class of Uppaal Timed Automata and show how this relation is interrelated with the data refinement relation in Event-B. Using this interrelation we present a way how the Event-B and Uppaal tools can complement each other in a refinement-based design flow. The approach is demonstrated on a well-studied case-study, namely the IEEE 1394 tree identify protocol.
|Otsikko||From Action Systems to Distributed Systems: The Refinement Approach|
|Toimittajat||Luigia Petre, Emil Sekerinski|
|DOI - pysyväislinkit|
|Tila||Julkaistu - 2016|
|OKM-julkaisutyyppi||A3 Kirjan osa tai toinen tutkimuskirja|
- Formal Methods, Real-Time Systems, Refinement