Comparing the reliability provided by tasks or protected objects for implementing a resource allocation service

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (1.53 MB)

Source

Annual International Conference on Ada archive
Proceedings of the conference on TRI-Ada '97 table of contents

St. Louis, Missouri, United States

Pages: 51 - 65

Year of Publication: 1997

ISBN:0-89791-981-5

Authors

C. Kaiser	Conservatoire National des Arts et Métiers, Laboratoire CEDRIC
J. F. Pradat-Peyre	Conservatoire National des Arts et Métiers, Laboratoire CEDRIC

Sponsors

Ada Europe : Ada Europe
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGSOFT: ACM Special Interest Group on Software Engineering
SIGPLAN: ACM Special Interest Group on Programming Languages
SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 9, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/269629.269636 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	Ber86	G. Berthelot, Transformations and decompositions of nets, Advances in Petri nets 1986, part I on Petri nets: central models and their properties, p.359-376, January 1987, Bad Honnef
	BHPP97	F. Breant, 2. Haddad, and J.F. Pradat-Peyre. Characterizing new reductions by means of language and invariant properties. Technical Report 97-04, Conservatoire National des Arts et M~tiers, laboratoire Cedric, ~Itp.cnam.fr/pub/ CNAM/cedric/tech_reporas/", 1997.
	BKPP97	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 M~tiers, laboratoire Cedric, "ftp.cnam.fr/pub / CNAM /cedric/tech_reports /n 1997.
	BPP96	Kamel Barkaoui , Jean-François Pradat-Peyre, On Liveness and Controlled Siphons in Petri Nets, Proceedings of the 17th International Conference on Application and Theory of Petri Nets, p.57-72, June 24-28, 1996
	Bro96	Benjamin M. Brosgol, The Dining Philosophers in Ada 95, Proceedings of the 1996 Ada-Europe International Conference on Reliable Software Technologies, p.247-261, June 10-14, 1996
	BW95	Alan Burns , Andy Wellings, Concurrency in Ada, Cambridge University Press, New York, NY, 1995
	CG77	P.J. Courtois and J. Georges. On starvation prevention. In RAIRO I~forrnatique/Coraput~r Science, volume 11, 1977.
	Dij71	E.W. Dijkstra. Hierarchical ordering of sequential processes. }In Aeta Inforraatica, number 1, pages 115-138, 1971.
	Had91	S. Haddad. A reduction theory for colored nets. In Jensen and Rozenberg, editors, Highlevel Petri Nets, Theory and Appiic. afion, LNCS, pages 399--425. Springer-Verlag, I991.
	Int95	In~ermetrics Inc. Aria 95 Rationale, 1995.
	KPP97	C. Kaiser and J.F. Pradat-Pey~e. Reliable resources allocation with Ada95 preference control. Technical Repor~ 97-06, Conservatoire Nafiofial des Arts e~ M~tiers, laboratoire Cedric, '~p.cnam. fr/pub/CNAM/ cedric/tech.repor~s/' ~ 1997.
	MSS89	Tadao Murata , Sol M. Shatz , Boris Shenker, Detection of Ada Static Deadlocks Using Petri Net Invariants, IEEE Transactions on Software Engineering, v.15 n.3, p.314-326, March 1989 [doi>10.1109/32.21759]
	Rei83	W. Reisig. BATC$-An Introduction to Peiri Nets. Springer-~erlag, 1983.
	TSM90	S. Tu, S.M. Shatz, and T. Murata. Applying Pe~ri neIs reduction to suppoxt Ada-tasking deadlock detection. In Proceedings of the i Oth tEEE In~. Conf. on Distributed Computing Systems, pages 96-102, Paris, France, June 1990.

CITED BY 2

	S. Evangelista , C. Kaiser , J. F. Pradat-Peyre , P. Rousseau, Verifying linear time temporal logic properties of concurrent Ada programs with quasar, ACM SIGAda Ada Letters, v.XXIV n.1, p.17-24, March 2004
	Claude Kaiser , Jean-François Pradat-Peyre , Sami Évangelista , Pierre Rousseau, Comparing Java, C# and Ada monitors queuing policies: a case study and its Ada refinement, ACM SIGAda Ada Letters, v.XXVI n.2, August 2006