Toggle Main Menu Toggle Search

ePrints

Modelling and verification of an atomic action protocol implemented in Ada

Lookup NU author(s): Dr Frank Burns, Dr Albert Koelmans, Professor Maciej Koutny, Professor Alexander Romanovsky, Professor Alex Yakovlev

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

Ada 95 is an expressive concurrent programming language with which it is possible to build complex multi-tasking applications. Much of the complexity of these applications stems from the interactions between the tasks. This paper argues that Petri nets offer a promising, tool-supported, technique for checking the logical correctness of the tasking algorithms. The paper illustrates the effectiveness of this approach by showing the correctness of an Ada implementation of the atomic action protocol using a variety of Petri net tools, including PED, PEP and INA for P/T nets and Design/CPN for coloured Petri nets. (37 References).


Publication metadata

Author(s): Burns A, Wellings AJ, Burns F, Koelmans AM, Koutny M, Romanovsky A, Yakovlev A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 21st International Workshop on Software Engineering and Petri Nets (SEPN)

Year of Conference: 2001

Pages: 173-182

Publisher: CRL Publishing


Share