Dense-timed petri nets: Checking zenoness, token liveness and boundedness

Logical Methods in Computer Science

Volumn 3, Issue 1, 2007, Pages

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

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c North Carolina State University   (United States)

Author keywords

Real time systems; Timed Petri nets; Verification; Zenoness

Indexed keywords

COMPUTABILITY AND DECIDABILITY; INTERACTIVE COMPUTER SYSTEMS; PETRI NETS; REAL TIME SYSTEMS; SEMANTICS; SYNTACTICS; VERIFICATION;

BOUNDEDNESS; COVERABILITY PROBLEM; FAST COMPUTATION; TIMED PETRI NET; TIMED PETRI NETS; UNDECIDABILITY; VERIFICATION PROBLEMS; ZENONESS;

PROBLEM SOLVING;

EID: 67651158476     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(1:1)2007     Document Type: Article

References (34)

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. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
3. P. Abdulla, J. Deneux, and P. Mahata. Multi-clock timed networks. In Proc. LICS’ 04, pages 345-354. IEEE Computer Society Press, 2004.
4. P. Abdulla, J. Deneux, P. Mahata, and A. Nylén. Forward reachability analysis of timed Petri nets. In Proc. FORMATS-FTRTFT’04, volume 3253 of Lecture Notes in Computer Science, pages 343-362. Springer, 2004.
5. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of Lecture Notes in Computer Science, pages 298-312, 1998.
6. P. A. Abdulla and B. Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science, 290(1):241-264, 2003.
7. R. Alur. Techniques for Automatic Verification of Real-Time Systems. PhD thesis, Dept. of Computer Sciences, Stanford University, 1991.
8. P. Abdulla, P. Mahata, and R. Mayr. Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets. In Proc. of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), volume 3328 of LNCS. Springer Ver-lag, 2004.
9. 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.
10. 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.
11. M. Ben-Ari. Mathematical Logic for Computer Science. Prentice Hall, 1993.
12. B. Bérard, F. Cassez, S. Haddad, O. Roux, and D. Lime. Comparison of Different Semantics for Time Petri Nets. In Proceedings of the Third International Symposium on Automated Technology for Verification and Analysis (ATVA’2005), volume 3707 of Lecture Notes in Computer Science, pages 81-94, Taipei, Taiwan, October 2005. Springer.
13. A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. of STACS’99, volume 1563 of LNCS. Springer Verlag, 1999.
14. F. D. J. Bowden. Modelling time in Petri nets. In Proc. Second Australian-Japan Workshop on Stochastic Models, 1996.
15. 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 LNCS, pages 187-206, 2000.
16. L. E. Dickson. Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics, 35:413-422, 1913.
17. C. Dufourd, P. Janˇcar, and Ph. Schnoebelen. Boundedness of Reset P/T Nets. In Proc. of ICALP’99, volume 1644 of LNCS. Springer Verlag, 1999.
18. A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition sytems. In Proc. LATIN ’98, volume 1380 of Lecture Notes in Computer Science, pages 102-118, 1998.
19. A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
20. S. Ginsburg. The Mathematical Theory of Context-free Languages. McGraw-Hill, 1966.
21. J.C. Godskesen. Timed Modal Specifications. PhD thesis, Aalborg University, 1994.
22. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas, and languages. Pacific J. of Mathematics, 16:285-296, 1966.
23. B. Heinemann. Subclasses of self-modifying nets. In Girault, C. and Reisig, W., editors, Informatik-Fachberichte 52: Application and Theory of Petri Nets: Selected Papers from the First and Second European Workshop on Application and Theory of Petri Nets, Strasbourg, Sep. 23-26, 1980, Bad Honnef, Sep. 28-30, 1981, pages 187-192. Springer-Verlag, 1982.
24. G. Higman. Ordering by divisibility in abstract algebras. Proc. London Math. Soc., 2:326-336, 1952.
25. R.M. Karp and R.E. Miller. Parallel program schemata. Journal of Computer and Systems Sciences, 3(2):147-195, May 1969.
26. P. Mahata. Model Checking Parameterized Timed Systems. PhD thesis, Dept. Of Information Technology, Uppsala University, Sweden, 2005.
27. R. Mayr. Undecidable problems in unreliable computations. TCS, 297(1-3):337-354, 2003.
28. T. Murata. Petri nets: Properties, analysis und applications. Proc. of the IEEE, 77(4):541-580, 1989.
29. R. J. Parikh. On context-free languages. Journal of the ACM, 13(4):570-581, 1966.
30. C. A. Petri. Kommunikation mit Automaten. PhD thesis, University of Bonn, 1962.
31. J.L. Peterson. Petri nets. Computing Surveys, 9(3):221-252, 1977.
32. 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.
33. S. Tripakis. Verifying progress in times systems. In Proc. ARTS ’99, pages 299-314, 1999.
34. R. Valk and M. Jantzen. The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets. Acta Informatica, 21:643-674, 1985.