Advertisement

Translating Time Petri Net Structures in Ada 95 Statements

  • F. J. García
  • J. L. Villarroel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1622)

Abstract

The intention of this paper is to show how real-time systems modeled with time Petri nets can be implemented in Ada 95. To achieve this objective, we use models of the Ada 95 tasking statements. Using reduction rules the model of the statement is reduced in order to make it recognizeable in the net which models the systems. Thus, we can build a catalogue of the reduced models of the Ada 95 tasking statements so that they can be used in the translation of net structures into Ada programs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Merlin and D.J. Farber. Recoverability of communication protocols. IEEE transactions on Communication, 24(9), September 1976.Google Scholar
  2. [2]
    B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE transactions on Software Engineering 17(3):259–273.Google Scholar
  3. [3]
    D. Mandrioli, R. Zicari, C. Ghezzi, and F. Tisato. Modeling the Ada task system by Petri nets. Computer Languates, 10(1):43–61, 1985.CrossRefGoogle Scholar
  4. [4]
    R.K. Gedela and S.M. Shatz. Modelling of advanced tasking in Ada-95: A Petri net perspective. In Proc. 2nd INt. Workshop on Software Engineering for Parallel and Distributed Systems, PSDE’97, Boston, USA, 1997.Google Scholar
  5. [5]
    U. Buy and S. Tu, T. Murata, and S. Duri. An application of Petri net reduction for Ada taska deadlock analysis. Proc. Int. Symp. on Software Testing and Analysis, pages 228–239, 1994.Google Scholar
  6. [6]
    S.M. Shatz, U. Buy, R. Devarapalli, and S.M. Shatz. Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada. IEEE Transactions on Parallel and Distrubuted Systems, 7(12):1307–1322, December 1996.CrossRefGoogle Scholar
  7. [7]
    S. Duri, U. Buy, R. Devarapalli, and S.M. Shatz. Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada. ACM Transaction on Software Engineering Methodology, 3(4):340–380, December 1994.CrossRefGoogle Scholar
  8. [8]
    W.M.P. van der Aaalst and M.A. Odijk. Analysis of railway stations by means of interval timed coloured Petri nets. Real-Time Systems, 9(3):241–263, November 1995.CrossRefGoogle Scholar
  9. [9]
    C. Gheri, D. Mandrioli, S. Morasca, and M. Pezze. A unified high-leve Petri net formalism for time-critical systems. IEEE transactions on Software Engineering, 17(2):160–171, February 1991.CrossRefGoogle Scholar
  10. [10]
    T. Murata, Petri nets: properties, analysis, and applications. Proceedings of the IEEE. 77(4). April 1989.Google Scholar
  11. [11]
    R.H. Sloan and U. Buy. Reduction rules for time Petri nets. Acata Informatica, 43687–706, 1996.CrossRefMathSciNetGoogle Scholar
  12. [12]
    J.M. Colom, M. Silva, and J.L. Villaroel. On software implementation of Petri Nets and Colored petri Nets using high level concurrent languages. In Proc. of 7th European Workshop on Application and Theory of Petri nets, pages 207–241, Oxford, England, January 1986.Google Scholar
  13. [13]
    F. Kordon. Proposal for a Generic Prototyping Approach. In IEEE Symposium on Emerging Technologies and Factory Automation, Tokyo, Japan, number 94TH8000, pages 396–403. IEEE Comp Soc Press, 1994.Google Scholar
  14. [14]
    F. Bréant and J.F. Peyre. An improved massively parallel implementation of colored Petri nets specifications. In IFIP-WG 10.3 working conference on programming environments for massively parallel distributed systems, Ascona, Switzeland, 1994.Google Scholar
  15. [15]
    F.J. García, and J.L. Villaroel. Decentralized implementation of real-time systems using time Petri nets. application to mobile robot control. In D.F. García Nocetti, editor, Proc. of the 5th IFAC/IFIP Workshop, Algorithms and Architectures for Real Time Control 1998, pages 11–16. Pergamon, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • F. J. García
    • 1
  • J. L. Villarroel
    • 2
  1. 1.Dpto. Matemáticas y Computac’onUniversidad de La RiojaLogra∼Spain
  2. 2.Dpto. de Informática e Ing. de SistemasCPS, Universidad de ZaragozaZaragozaSpain

Personalised recommendations