Decidability of properties of timed-arc petri nets

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

Volumn 1825, Issue , 2000, Pages 187-206

  De Frutos Escrig, David ^a   Ruiz, Valentín Valero ^b   Alonso, Olga Marroquín ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY;

BOUNDEDNESS; COVERABILITY; REACHABILITY PROBLEM; TIMED-ARC PETRI NETS;

PETRI NETS;

EID: 84888307926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. W.M.P. van der Aalst. Interval Timed Coloured Petri Nets and their Analysis. LNCS vol. 691, pp. 451-472. 1993.
2. P.A. Abdulla, K. Čerans, B. Jonsson and T. Yih-Kuen. General Decidability Theorems for In_nite-State Systems. Proc. 11th IEEE Symp. Logic in Computer Science (LICS'96), New Brunswick, NJ, USA, July 1996, pages 313-321. 1996.
3. M. Ajmone Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte and A. Cumani. On Petri Nets with Stochastic Timing. Proc. of the International Workshop on Timed Petri Nets, IEEE Computer Society Press, pp. 80-87. 1985.
4. A. Arnold and M. Latteux. Vector Addition Systems and Semi-Dyck Language. Research Report 78, Laboratoire de Calcul de l'Université des Sciences et Techniques de LILLE, December 1976.
5. T. Bolognesi and P. Cremonese. The Weakness of Some Timed Models for Concurrent Systems. Technical Report CNUCE C89-29. CNUCE-C.N.R. October 1989.
6. T. Bolognesi, F. Lucidi and S. Trigila. From Timed Petri Nets to Timed LO- TOS. Proc. of the 10th International IFIP WG6.1 Symposium on Protocol Specification, Testing and Verification, North-Holland. 1990.
7. F.D.J. Bowden. Modelling Time in Petri Nets. Proc. Second Australia-Japan Workshop on Stochastic Models. 1996.
8. A. Cerone and A. Maggiolo-Schettini. Time-based Expressivity of Time Petri Nets for System Specification. Theoretical Computer Science (216)1-2, pp. 1-53. 1999.
9. C. Dufourd, A. Finkel and Ph. Schnoebelen. Reset Nets between Decidability and Undecidability. Proc. 25th. Int. Coll. Automata, Languages, and Programming (ICALP'98), Aalborg, Denmark, July 1998, LNCS vol. 1443, pp:103-115. Springer-Verlag, 1998.
10. C. Dufourd. Réseaux de Petri avec Reset/Transfert: Décidabilité et Indécidabilité. Thése de Docteur en Sciences de l' École Normale Supérieure de Cachan. October 1998.
11. C. Dufourd, P. Jančar and Ph. Schnoebelen. Boundedness of Reset P/T Nets. Proc. 26th. Int. Coll. Automata, Languages, and Programming (ICALP'99), Prague, Czech Rep., July 1999, LNCS vol. 1644, pp. 301-310. Springer-Verlag, 1999.
12. A. Finkel. Reduction and Covering of Infinite Reachability Trees. Information and Computation, 89(2):144-179, 1990.
13. A. Finkel and Ph. Schnoebelen. Fundamental Structures in Well-Structured Infinite Transition Systems. Proc. 3rd Latin American Theoretical Informatics Symposium (LATIN'98), Campinas, Brazil, Apr. 1998, LNCS vol. 1380, pp:102-118. Springer-Verlag, 1998.
14. H.-M. Hanisch. Analysis of Place/Transition Nets with Timed-Arcs and its Application to Batch Process Control. Application and Theory of Petri Nets, LNCS vol. 691, pp:282-299. Springer-Verlag, 1993.
15. R. Mayr. Lossy Counter Machines. Technical report TUM-I9827, TUM ünchen, 1998.
16. P. Merlin. A Study of the Recoverability of Communication Protocols. PhD. Thesis, Univ. of California. 1974.
17. J. L. Peterson. Petri net Theory, and the Modeling of Systems. Prentice-Hall. 1981.
18. J. Quemada, A. Azcorra, and D. de Frutos. A Timed Calculus for LOTOS. Proc. FORTE'89, pp. 245-264. 1989.
19. C. Ramchandani. Performance Evaluation of Asynchronous Concurrent Sys- tems by Timed Petri Nets. PhD. Thesis, Massachusetts Institute of Technology, Cambridge. 1973.
20. J. Sifakis. Use of Petri Nets for Performance Evaluation. Proc. of the Third International Symposium IFIP W.G.7.3., Measuring, Modelling and Evaluating Computer Systems. Elsevier Science Publishers, pp. 75-93. 1977.
21. V. Valero, D. de Frutos Escrig, and F. Cuartero. Decidability of the Strict Reachability Problem for TPN's with Rational and Real Durations. Proc. 5th. International Workshop on Petri Nets and Performance Models, pp. 56-65. 1993.
22. V. Valero, D. de Frutos Escrig, and F. Cuartero. On Non-Decidability of Reach- ability for Timed-Arc Petri Nets. Proc. 8th. International Workshop on Petri Nets and Performance Models, pp. 188-196. 1999.
23. B. Walter. Timed Petri-Nets for Modelling and Analysing Protocols with Real- Time Characteristics. Proc. 3rd IFIP Workshop on Protocol Specification, Testing and Verification, North-Holland. 1983.