A translation based method for the timed analysis of scheduling extended time Petri nets

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2004, Pages 187-196

  Lime, Didier ^a   Roux, Olivier ^a  

^a INSTITUT DE RECHERCHE EN COMMUNICATIONS ET CYBERNÉTIQUE DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; MATRIX ALGEBRA; ONLINE SYSTEMS; PETRI NETS; SCHEDULING; STATE SPACE METHODS;

ONLINE SCHEDULING ANALYSIS; SCHEDULING CONSTRAINTS; SCHEDULING EXTENDED TIME PETRI NETS (SETPN); STOPWATCH AUTOMATION (SWA);

REAL TIME SYSTEMS;

EID: 21644468286     PISSN: 10528725     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. R. Alur and D. L. Dill. A theory of timed automata. Theoretical Computer Science, 126(2): 183-235, 1994.
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, 1991.
3. G. Bucci, A. Fedeli, L. Sassoli, and E. Vicario. Modeling flexible real time systems with preemptive time Petri nets. In 15th Euromicro Conference on Real-Time Systems (ECRTS'2003), pages 279-286, 2003.
4. G. Bucci, A. Fedeli, L. Sassoli, and E. Vicario. Time state space analysis of real-time preemptive systems. IEEE transactions on software engineering, 30(2):97-111, February 2004.
5. F. Cassez and K. Larsen. The impressive power of stop-watches. In C. Palamidesi, editor, 11th International Conference on Concurrency Theory, (CONCUR'2000), number 1877 in Lecture Notes in Computer Science, pages 138-152, University Park, P.A., USA, July 2000. Springer-Verlag.
6. G. B. Dantzig. Linear programming and extensions. IEICE Transactions on Information and Systems, 1963.
7. C. Daws and S. Yovine. Reducing the number of clock variables of timed automata. In 1996 IEEE Real-Time Systems Symposium (RTSS'96), pages 73-81, Washington, DC, USA, december 1996. IEEE Computer Society Press.
8. E. Fersman, P. Petterson, and W. Yi. Timed automata with asynchronous processes: Schedulability and decidability. In 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'02), volume 2280 of Lecture Notes in Computer Science, pages 67-82, Grenoble, France, 2002. Springer-Verlag.
9. M. Harbour, M. Klein, and J. Lehoczky. Fixed priority scheduling of periodic tasks with varying execution priority. In 12th IEEE Real-Time Systems Symposium (RTSS'91), pages 116-128, San Antonio, USA, december 1991. IEEE Computer Society Press.
10. T. Henzinger, P.-H. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. Journal of Software Tools for Technology Transfer, 1(1-2): 110-122, 1997.
11. P.-E. Hladik and A.-M. Déplanche. Analyse d'ordonnançabilité de tâches temps-réel avec offset et gigue. In 11th international Conference on Real-Time Systems (RTS'03), pages 307-332, Paris, France, april 2003.
12. K. G. Larsen, P. Pettersson, and W. Yi. Model-checking for real-time systems. In Fundamentals of Computation Theory, pages 62-88, 1995.
13. D. Lime and O. Roux. State class stopwatch automaton of a scheduling extended time Petri net for the verification of real-time systems. Technical report, Institut de Recherche en Communications et Cybernétique de Nantes (IRCCyN), 2004.
14. D. Lime and O. H. Roux. Expressiveness and analysis of scheduling extended time Petri nets. In 5th IFAC International Conference on Fieldbus Systems and their Applications, (FET'03). Elsevier Science, July 2003.
15. D. Lime and O. H. Roux. State class timed automaton of a time Petri net. In 10th International Workshop on Petri Nets and Performance Models, (PNPM'03). IEEE Computer Society, Sept. 2003.
16. C. Liu and J. Layland. Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of ACM, 20(1):44-61, January 1973.
17. P. M. Merlin. A study of the recoverability of computing systems. PhD thesis, Department of Information and Computer Science, University of California, Irvine, CA, 1974.
18. Y. Okawa and T. Yoneda. Schedulability verification of realtime systems with extended time Petri nets. International Journal of Mini and Microcomputers, 18(3): 148-156, 1996.
19. J. Palencia and M. Harbour. Schedulability analysis for tasks with static and dynamic offsets. In 19th IEEE Real-Time Systems Symposium (RTSS'98), pages 26-37, Madrid, Spain, december 1998. IEEE Computer Society Press.
20. J. Palencia and M. Harbour. Exploiting precedence relations in the scheduling analysis of distributed real-time systems. In 20th IEEE Real-Time Systems Symposium (RTSS'99), pages 328-339, Phoenix, Arizona, USA, december 1999. IEEE Computer Society Press.
21. O. H. Roux and A.-M. Déplanche. A t-time Petri net extension for real time-task scheduling modeling. European Journal of Automation (JESA), 36(7), 2002.
22. O. H. Roux and D. Lime. Time Petri nets with inhibitor hyperarcs. Formal semantics and state space computation. In The 25th International Conference on Application and Theory of Petri nets, (ICATPN'04), Bologna, Italy, June 2004. Lecture Notes in Computer Science.
23. K. Tindell. Fixed priority scheduling of hard real-time systems. PhD thesis, Department of Computer Science, University of New York, 1994.