Verification in concurrent programming with Petri nets structural techniques

Proceedings - 3rd IEEE International High-Assurance Systems Engineering Symposium, HASE 1998

Volumn 1998-November, Issue , 1998, Pages 124-133

  Barkaoui, K ^a   Pradat Peyre, J F ^a  

^a Bioinformatique et Chimie Moléculaire   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ADA (PROGRAMMING LANGUAGE); PETRI NETS; PROGRAM TRANSLATORS; STATIC ANALYSIS; SYSTEMS ENGINEERING;

BEHAVIORAL PROPERTIES; CLIENT /SERVER; CONCURRENT PROGRAM; CONCURRENT PROGRAMMING; DEADLOCK FREENESS; STRUCTURAL CONDITION; STRUCTURAL TECHNIQUES; STRUCTURE THEORY;

CONCURRENCY CONTROL;

EID: 0002413663     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HASE.1998.731604     Document Type: Conference Paper

References (22)

1. K. Barkaoui, J. Couvreur, and C. Duteilhet. On liveness in extended non self-controlling nets in application and theory of Petri nets. LNCS, 935, 1995.
2. K. Barkaoui, C. Kaiser, and J. Pradat-Peyre. Petri nets based proofs of Ada95 solution for preference control. In Proc.of the Asia Pacific Software Engineering Conference (APSEC) and International Computer Science Conference (ICSC), Hong-Kong, 1997.
3. K. Barkaoui and M. Minoux. Deadlocks and traps in Petri nets as horn satisfiability solutions and some related polynomially solvable problems. Discrete Applied Mathematics, No. 29, 1990.
4. K. Barkaoui and M. Minoux. A polynomial time graph algorithm to decide liveness of some basic classes of bounded Petri nets. LNCS, No. 616:62-75, 1992.
5. K. Barkaoui and J. Pradat-Peyre. On liveness and controlled siphons in Petri nets. In Reisig, editor, Petri Nets, Theory and Application, number 1091 in LNCS. Springer-Verlag, 1996.
6. E. Best. Structure theory of Petri nets : The free choice hiatus. In G. W.Brauer, W.Resig, editor, LNCS, volume No. 255. Springer-Verlag, 1986.
7. A. Burns, M. Lister, and A. Wellings. A review of Ada tasking. In LNCS. Springer-Verlag, 1987.
8. A. Burns and A. Wellings. Concurrency in Ada, chapter 6.11, pages 134-137. Cambridge University Press, 1995.
9. J. Corbett. Evaluating deadlock detection methods for concurrent software. IEEE Transactions on Software Engineering, Vol. 22(No. 3), 1996.
10. C. E.G., E. M.J., and S. A. Systems deadlocks. In Computing Survey, 3 (2), 1971.
11. J. Esparza and M. Silva. A polynomial-Time algorithm to decide liveness of bounded freechoice nets. T.C.S, N 102:185-205, 1992.
12. J. Ezpeleta and J. Couvreur. A new technique for finding a generative family of siphons, traps and st-components. In proc of the 12th International Conference on Application and Theory of Petri-Nets, Aarhus, Denmark, June 1991.
13. C. Kaiser and J. Pradat-Peyre. Comparing the reliability provided by tasks or protected objetcs for implementing a resource allocation service : A case study. In TriAda, St Louis, Missouri, november 1997. ACM SIGAda.
14. D. Mandrioli, R. Zicari, C. Ghezzi, and F. Tisato. Modeling the Ada task system by Petri nets. Computer Languages, Vol. 10(NO. 1):43-61, 1985.
15. T. Murata, B. Shenker, and S. Shatz. Detection of Ada static deadlocks using Petri nets invariants. IEEE Transactions on Software Engineering, Vol. 15(No. 3):314-326, March 1989.
16. M. Notomi and T. Murata. Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis. IEEE Transactions on Software Engineering, Vol. 20(No. 5):325-336, May 1994.
17. S. Owicki and L. Lamport. Proving liveness property of concurrent programs. In ACM Transaction on Programming Languages and Systems, Vol. 4, N.3, pp. 455-495, 1982.
18. M. R. Communication and concurrency. In Prentice Hall Ed., 1989.
19. W. Reisig. EATCS-An Introduction to Petri Nets. Springer-Verlag, 1983.
20. S. Shatz, K. Mai, D. Moorthi, and J. Woodward. A toolkit for automated support of Ada-Tasking analysis. In Proceedings of the 9th Int. Conf. on Distributed Computing Systems, pages 595-602, June 1989.
21. R. Taylor. A general purpose algorithm for analyzing concurrent programs. Communication of ACM, Vol. 26(No. 5):362-376, May 1983.
22. S. Tu, S. Shatz, and T. Murata. Applying Petri nets reduction to support Ada-Tasking deadlock detection. In Proceedings of the 10th IEEE Int. Conf. on Distributed Computing Systems, pages 96-102, Paris, France, June 1990.