Double Reduction of Ada-ECATNet Representation Using Rewriting Logic

Free registration required

Executive Summary

One major difficulty that faces developers of concurrent and distributed software is analysis for concurrency based faults like deadlocks. Petri nets are used extensively in the verification of correctness of concurrent programs. ECATNets are a category of algebraic Petri nets based on a sound combination of algebraic abstract types and high-level Petri nets. ECATNets have 'Sound' and 'Complete' semantics because of their integration in rewriting logic and its programming language Maude. Rewriting logic is considered as one of very powerful logics in terms of description, verification and programming of concurrent systems. The authors proposed in a method for translating Ada-95 tasking programs to ECATNets formalism (Ada-ECATNet).

  • Format: PDF
  • Size: 384.8 KB