High level timed Petri net templates for the temporal verification of real-time multiprocessor applications

  • Authors:
  • Dimitra Ananidou;George Hassapis;Dimitrios Kleftouris

  • Affiliations:
  • Technological Educational Institute of Thessaloniki, Thessaloniki, Greece;Aristotle University of Thessaloniki, Thessaloniki, Greece;Technological Educational Institute of Thessaloniki, Thessaloniki, Greece

  • Venue:
  • PCI'01 Proceedings of the 8th Panhellenic conference on Informatics
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work templates for modeling the execution of application software on a shared memory real-time multiprocessor system are presented. These templates are parameterized High Level Timed Petri Nets which can be adapted to the design specifications of a specific application software design by customizing their token data structures. Simulating the solution of the derived Petri net models, the satisfaction of timing characteristics of the application software design, such as response time to external stimuli, can be studied. Each model describes with the same degree of detail the execution of application software running on the specific computer platform. Three different application programs were modeled by each template and a comparative evaluation of the ability of the three templates to predict timing characteristics of these programs was performed. On the basis of the results of this study the model that predicts the timing characteristics of the software execution with the best computation cost, is identified.