Translating time Petri net structures into Ada 95 statements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1622, Issue , 1999, Pages 158-169

  Garcia F J ^a   Villarroel, J L ^b  

^a UNIVERSITY OF LA RIOJA   (Spain)

^b UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

INTERACTIVE COMPUTER SYSTEMS; PETRI NETS; PROGRAM TRANSLATORS; REAL TIME SYSTEMS;

ADA PROGRAMS; NET STRUCTURES; REDUCED MODEL; REDUCTION RULES; TIME PETRI NETS; USE-MODEL;

ADA (PROGRAMMING LANGUAGE);

EID: 4244049983     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48753-0_14     Document Type: Conference Paper

References (15)

1. P. Merlin and D.J. Farber. Recoverability of communication protocols. IEEE transactions on Communication, 24(9), September 1976.
2. B. Berthomieu and M. Diaz. Modeling and verification of time dependent systems using time Petri nets. IEEE transactions on Software Engineering, 17(3):259-273, March 1991.
3. D. Mandrioli, R. Zicari, C. Ghezzi, and F. Tisato. Modeling the Ada task system by Petri nets. Computer Languages, 10(1):43-61, 1985.
4. R.K. Gedela and S.M. Shatz. Modelling of advanced tasking in Ada-95: A Petri net perspective. In Proc. 2nd Int. Workshop on Software Engineering for Parallel and Distributed Systems, PSDE’97, Boston, USA, 1997.
5. U. Buy and R.H. Sloan. Analysis of real-time programs with simple time Petri nets. In Proc. Int. Symp. on Software Testing and Analysis, pages 228-239, 1994.
6. S.M. Shatz, S. Tu, T. Murata, and S. Duri. An application of Petri net reduction for Ada tasking deadlock analysis. IEEE Transactions on Parallel and Distributed Systems, 7(12): 1307-1322, December 1996.
7. S. Duri, U. Buy, R. Devarapalli, and S.M. Shatz. Application and experimental evaluation of state space reduction methods for deadlock analysis in Ada. ACM Transaction on Software Engeeniering Methodology, 3(4):340-380, December 1994.
8. W.M.P. van der Aalst and M.A. Odijk. Analysis of railway stations by means of interval timed coloured Petri nets. Real-Time Systems, 9(3):241-263, November 1995.
9. C. Ghezzi, D. Mandrioli, S. Morasca, and M. Pezze. A unified high-level Petri net formalism for time-critical systems. IEEE transactions on Software Engineering, 17(2):160-171, February 1991.
10. T. Murata. Petri nets: properties, analysis, and applications. Proceedings of the IEEE, 77(4), April 1989.
11. R.H. Sloan and U. Buy. Reduction rules for time Petri nets. Acta Informatica, 43:687-706, 1996.
12. J.M. Colom, M. Silva, and J..L. Villarroel. On software implementation of Petri Nets and Colored Petri Nets using high level concurrent languages. In Proc. of 7th European Workshop on Application and Theory of Petri nets, pages 207-241, Oxford, England, January 1986.
13. F. Kordon. Proposal for a Generic Prototyping Approach. In IEEE Symposium on Emerging Technologies and Factory Automation, Tokyo, Japan, number 94TH8000, pages 396-403. IEEE Comp Soc Press, 1994.
14. F. Bréant and J.F. Peyre. An improved massively parallel implementation of colored Petri nets specifications. In IFIP-WG 10.3 working conference on programming environments for massively parallel distributed systems, Ascona, Switzerland, 1994.
15. F.J. García and J.L. Villarroel. Decentralized implementation of real-time systems using time Petri nets, application to mobile robot control. In D.F. Garcia Nocetti, editor, Proc. of the 5th IFAC/IFIP Workshop, Algorithms and Architectures for Real Time Control 1998, pages 11-16. Pergamon, 1998.