Modelling and verification of an atomic action protocol implemented in Ada
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 FED, PEP and INA for P/T nets and Design/CPN for Coloured Petri nets.
atomic action protocol ada 95 petri nets