Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets

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

Volumn 3328, Issue , 2004, Pages 58-70

  Abdulla, Parosh ^a   Mahata, Pritha ^a   Mayr, Richard ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; PETRI NETS; PROBLEM SOLVING; SYNTACTICS; SEMANTICS; SOFTWARE ENGINEERING;

BOUNDEDNESS; COVERABILITY PROBLEM; LIVENESS; MILLER'S ALGORITHM; TIMED PETRI NET; UNDECIDABILITY; VERIFICATION PROBLEMS; ZENONESS;

SEMANTICS; PROBLEM SOLVING;

EID: 33746368002     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_6     Document Type: Article

References (16)

1. R. Alur and D. Dill. Automata for modelling real-time systems. In Proc. ICALP '90, volume 443 of Lecture Notes in Computer Science, pages 322-335, 1990.
2. P. A. Abdulla, J. Deneux, and P. Mahata. Multi-clock timed networks. In Proc. LICS '04, pages 345-354. IEEE Computer Society Press, 2004.
3. P. A. Abdulla and B. Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science, 290(1):241-264, 2003.
4. R. Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Dept. of Computer Sciences, Stanford University, 1991.
5. P. A. Abdulla and A. Nylén. Timed Petri nets and BQOs. In Proc. ICATPN'2001: 22nd Int. Conf. on application and theory of Petri nets, volume 2075 of Lecture Notes in Computer Science, pages 53-70, 2001.
6. P. A. Abdulla and A. Nylén. Undecidability of ltl for timed petri nets. In INFINITY 2002, 4th International Workshop on Verification of Infinite-State Systems, 2002.
7. F. D. J. Bowden. Modelling time in Petri nets. In Proc. Second Australian-Japan Workshop on Stochastic Models, 1996.
8. D. de Frutos Escrig, V. Valero Ruiz, and O. Marroquín Alonso. Decidability of properties of timed-arc Petri nets. In ICATPN 2000, number 1825 in Lecture Notes in Computer Science, pages 187-206, 2000.
9. C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T Nets. In Proc. of ICALP'99, volume 1644 of LNCS. Springer Verlag, 1999.
10. J.C. Godskesen. Timed Modal Specifications. PhD thesis, Aalborg University, 1994.
11. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2:326-336, 1952.
12. R.M. Karp and R.E. Miller. Parallel program schemata. Journal of Computer and Systems Sciences, 3(2):147-195, May 1969.
13. R. Mayr. Undecidable problems in unreliable computations. TCS, 297(1-3):337-354, 2003.
14. V. Valero Ruiz, F. Cuartero Gomez, and D. de Frutos Escrig. On non-decidability of reachability for timed-arc Petri nets. In Proc. 8th International Workshop on Petri Nets and Performance Models, pages 188-196, 1999.
15. S. Tripakis. Verifying progress in times systems. In Proc. ARTS '99, pages 299-314, 1999.
16. R. Valk and M. Jantzen. The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica, 21:643-674, 1985.