Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
R. S. Arnold. Software reengineering, IEEE Computer society, Inc., 1993.
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.
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.
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.
M. B. Dwyer, K. A. Nies et L. A. Clarke. A compact Petri net representation for Ada tasking programs University of Massachusetts.
H. Ehrig and B. Mahr. Fundamentals of algebraic Specification 1: Equations and Initial Semantics, volume 6 EATC Monographs. Springer-Verlag, 1985.
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.
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.
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.
W. Reisig. Petri nets: an introduction. EATCS Monograph on Theoretical computer Science, Vol 4, Springer Verlag 1985.
S. R. Schach Software engineering, Irwin, Aksen associates, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchs, D., Buffard, C., Racloz, P. (1996). Modelling and validation of tasks with algebraic structured nets. In: Toussaint, M. (eds) Ada in Europe. Ada-Europe 1995. Lecture Notes in Computer Science, vol 1031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015502
Download citation
DOI: https://doi.org/10.1007/BFb0015502
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60757-1
Online ISBN: 978-3-540-49362-4
eBook Packages: Springer Book Archive