Comparing the reliability provided by tasks or protected objects for implementing a resource allocation service : A case study

Proceedings of the Conference on TRI-Ada 1997, TRI-Ada 1997

Volumn , Issue , 1997, Pages 51-65

  Kaiser, C ^a   Pradat Peyre, J F ^a  

^a Bioinformatique et Chimie Moléculaire   (France)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; PHILOSOPHICAL ASPECTS; SEMANTICS;

COLORED PETRI NETS; DINING PHILOSOPHERS PROBLEM; EXECUTION SEMANTICS; INFORMAL PROOFS; INTERNAL STATE; ON STATE; PROTECTED OBJECT;

RESOURCE ALLOCATION;

EID: 85032370869     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/269629.269636     Document Type: Conference Paper

References (15)

1. G. Berthelot. Transformations and decompositions of nets. In Advances in Petri Nets, number 254 in LNCS, pages 359-376. Springer-Verlag, 1986.
2. F. Breant, S. Haddad, and J.F. Pradat-Peyre. Characterizing new reductions by means of lan-guage and invariant properties. Technical Report 97-04, Conservatoire National des Arts et Metiers, laboratoire Cedric, ftp.cnam.fr/pub/CNAM/cedric/tech-reports/, 1997.
3. K. Barkaoui, C. Kaiser, and J.F. Pradat-Peyre. Petri nets based proofs of Ada 95 solution for preference control. Technical Report 97-08, Conservatoire National des Arts et Metiers, laboratoire Cedric, ftp.cnam.fr/pub/CNAM/cedric/tech-reports/, 1997.
4. K. Barkaoui and J.F. Pradat-Peyre. On liveness on controlled siphons in Petri nets. In Reisig, editor, Petri Nets, Theory and Application, number 1091 in LNCS. Springer-Verlag, 1996.
5. B. Brosgol. The dining philosophers in Ada95. In Reliable Software Technologies-Ada-Europe '96, number 1088 in LNCS, pages 247-261. Springer- Verlag, 1996.
6. A Burns and A. Wellings. Concurrency in Ada, chapter 6.11, pages 134-137. Cambridge Univer-sity Press, 1995.
7. P. J. Courtois and J. Georges. On starvation prevention. In RAIRO Informatique/Computer Science, volume 11, 1977.
8. E.W. Dijkstra. Hierarchical ordering of sequential processes. In Acta Informatics, number 1, pages 115-138, 1971.
9. S. Haddad. A reduction theory for colored nets. In Jensen and Rozenberg, editors, High- level Petri Nets, Theory and Application, LNCS, pages 399-425. Springer-Verlag, 1991.
10. Intermetrics Inc. Ada 95 Rationale, 1995.
11. C Kaiser and J.F. Pradat-Peyre. Reliable resources allocation with Ada95 preference control. Technical Report 96-106,
12. Conservatoire National des Arts et Metiers, laboratoire Cedric, ftp.cnam.fr/pub/CNAM/cedric/tech-reports/, 1997.
13. T. Murata, B. Shenker, and S.M. Shatz. Detection of Ada static deadlocks using Petri nets invariants. IEEE Transactions on Software Engineering, Vol. 15(No. 3):314-326, March 1989.
14. W. Reisig. EATGS-An Introduction to Petri Nets. Springer-Verlag, 1983.
15. S. Tu, S.M. Shatz, and T. Murata. Applying Petri nets reduction to support Ada-tasking deadlock detection. In Proceedings of the 10th IEEE Int. Gonf. on Distributed Computing Systems, pages 96-102, Paris, France, June 1990.