Modelling and validation of tasks with algebraic structured nets

  • D. Buchs
  • C. Buffard
  • P. Racloz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1031)


Ada offers several mechanisms for expressing concurrency, like tasks and protected types. The use of concurrency can introduce significant problems which are inherent in the program's interactions or can require some particular properties. Amongst these problems or necessary properties, we can mention deadlocks, fairness and particular temporal characteristics. The modelling of concurrency behavior with tools can help prevent these problems. For this purpose, we show in this paper that programs written in Ada can be modelled using the formalism CO-OPN, based on Petri nets and algebraic specifications, which offers the possibility to select the level of abstraction of the modelling. These modelling can be used to detect the program anomalies.


Ada protected type task abstract data type concurrency CO-OPN Petri net 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Arnold 93]
    R. S. Arnold. Software reengineering, IEEE Computer society, Inc., 1993.Google Scholar
  2. [BFR 93]
    D. Buchs, J. Flumet, P. Racloz. SANDS: Structured Algebraic Net Development System 14th Int. Conf. on Application and Theory of Petri Nets, Tool presentation abstract (Ugo Buy ed.) page. 25–29, Chicago, USA, 1993.Google Scholar
  3. [BG 91]
    D. Buchs, N. Guelfi. CO-OPN: a Concurrent Object Oriented Petri Net approach 12th Int. Conf. on Application and Theory of Petri Nets, page 432–454, Aahrus,1991.Google Scholar
  4. [DHP 91]
    C. Dimitrovici, U. Hummert, and L. Petrucci. Semantics, composition, and properties of algebraic high-level nets.In Advances in Petri nets, volume 524 of LNCS, page 93–117. Springer Verlag, 1991.Google Scholar
  5. [DNC]
    M. B. Dwyer, K. A. Nies et L. A. Clarke. A compact Petri net representation for Ada tasking programs University of Massachusetts.Google Scholar
  6. [EM 85]
    H. Ehrig and B. Mahr. Fundamentals of algebraic Specification 1: Equations and Initial Semantics, volume 6 EATC Monographs. Springer-Verlag, 1985.Google Scholar
  7. [Kie 89]
    A. Kiehn. Petri net systems and their closure properties. In Grzegorz Rozenberg, editor, Advances in Petri nets, volume 424 of LNCS, pages 306–328, Berlin, 1989.Google Scholar
  8. [MSS 89]
    T. Murata, B. Shenker et M. Shatz. Detection of Ada static deadlocks using Petri net invariants,IEEE Transaction on software Engineering volume 15 number 3, 1989.Google Scholar
  9. [RB 93]
    P. Racloz, D. Buchs. Symbolic Proof of CTL formulae over Petri Nets 8th Int. Symp. on Computer and Information Sciences pp. 189–196, Istanbul, 1993.Google Scholar
  10. [Reisig 85]
    W. Reisig. Petri nets: an introduction. EATCS Monograph on Theoretical computer Science, Vol 4, Springer Verlag 1985.Google Scholar
  11. [SE 90]
    S. R. Schach Software engineering, Irwin, Aksen associates, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • D. Buchs
    • 1
  • C. Buffard
    • 1
  • P. Racloz
    • 1
  1. 1.Software Engineering Laboratory EPFL-DI-LGLSwiss Federal Institute of Technology in LausanneLausanneSwitzerland

Personalised recommendations