The ordinal-recursive complexity of timed-arc petri nets, data nets, and other enriched nets

Proceedings of the 2012 27th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2012

Volumn , Issue , 2012, Pages 355-364

  Haddad, Serge ^a   Schmitz, Sylvain ^a   Schnoebelen, Philippe ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Complexity theory; fast growing hierarchy; formal verification; Petri nets; well structured systems

Indexed keywords

COMPLEXITY THEORY; COMPUTATIONAL POWER; FAST-GROWING HIERARCHY; FORMAL VERIFICATIONS; LOWER BOUNDS; TIMED-ARC PETRI NETS; UPPER BOUND;

COMPUTER SIMULATION; PETRI NETS;

COMPUTATION THEORY;

EID: 84866949940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2012.46     Document Type: Conference Paper

References (23)

1. P. A. Abdulla, G. Delzanno, and L. Van Begin, "A classification of the expressive power of well-structured transition systems," Inform. and Comput., vol. 209, pp. 248-279, 2011.
2. P. Abdulla, P. Mahata, and R. Mayr, "Dense-timed Petri nets: Checking Zenoness, token liveness and boundedness," Logic. Meth. in Comput. Sci., vol. 3, p. 1, 2007.
3. P. A. Abdulla and G. Delzanno, "On the coverability problem for constrained multiset rewriting," in AVIS 2006, 2006.
4. P. A. Abdulla and A. Nylén, "Timed Petri nets and BQOs," in Petri Nets 2001, ser. LNCS, vol. 2075. Springer, 2001, pp. 53-70.
5. P. A. Abdulla, K. Čerāns, B. Jonsson, and Y.-K. Tsay, "Algorithmic analysis of programs with well quasiordered domains," Inform. and Comput., vol. 160, pp. 109-127, 2000.
6. T. Bolognesi, F. Lucidi, and S. Trigila, "From timed Petri nets to timed LOTOS," in PSTV '90. North-Holland, 1990, pp. 395-408.
7. R. Bonnet, A. Finkel, S. Haddad, and F. Rosa-Velardo, "Comparing Petri Data Nets and Timed Petri Nets," LSV, ENS Cachan, Research Report LSV-10-23, Dec. 2010. [Online]. Available: http://tinyurl.com/82vwcxf
8. -, "Ordinal theory for expressiveness of well structured transition systems," in FoSSaCS 2011, ser. LNCS, vol. 6604. Springer, 2011, pp. 153-167.
9. P. Bouyer, S. Haddad, and P.-A. Reynier, "Timed Petri nets and timed automata: On the discriminating power of Zeno sequences," Inform. and Comput., vol. 206, pp. 73-107, 2008.
10. P. Chambart and Ph. Schnoebelen, "The ordinal recursive complexity of lossy channel systems," in LICS 2008. IEEE, 2008, pp. 205-216.
11. C. Dufourd, A. Finkel, and Ph. Schnoebelen, "Reset nets between decidability and undecidability," in ICALP '98, ser. LNCS, vol. 1443. Springer, 1998, pp. 103-115.
12. M. V. H. Fairtlough and S. S. Wainer, "Ordinal complexity of recursive definitions," Inform. and Comput., vol. 99, pp. 123-153, 1992.
13. D. Figueira, S. Figueira, S. Schmitz, and Ph. Schnoebelen, "Ackermannian and primitive-recursive bounds with Dickson's Lemma," in LICS 2011. IEEE, 2011, pp. 269-278.
14. A. Finkel and Ph. Schnoebelen, "Well-structured transition systems everywhere!" Theor. Comput. Sci., vol. 256, pp. 63-92, 2001.
15. A. Finkel, P. McKenzie, and C. Picaronny, "A well-structured framework for analysing Petri nets extensions," Inform. and Comput., vol. 195, pp. 1-29, 2004.
16. H. M. Friedman, "Some decision problems of enormous complexity," in LICS 1999. IEEE, 1999, pp. 2-13.
17. G. Geeraerts, J.-F. Raskin, and L. V. Begin, "Well-structured languages," Acta Inf., vol. 44, pp. 249-288, 2007.
18. L. Jacobsen, M. Jacobsen, M. Møller, and J. Srba, "Verification of timed-arc Petri nets," in SOFSEM 2011, ser. LNCS, vol. 6543. Springer, 2011, pp. 46-72.
19. R. Lazić, T. Newcomb, J. Ouaknine, A. Roscoe, and J. Worrell, "Nets with tokens which carry data," Fund. Inform., vol. 88, pp. 251-274, 2008.
20. M. Löb and S. Wainer, "Hierarchies of number theoretic functions, I," Arch. Math. Logic, vol. 13, pp. 39-51, 1970.
21. F. Rosa-Velardo and D. de Frutos-Escrig, "Decidability and complexity of Petri nets with unordered data," Theor. Comput. Sci., vol. 412, pp. 4439-4451, 2011.
22. S. Schmitz and Ph. Schnoebelen, "Multiply-recursive bounds with Higman's Lemma," in ICALP 2011, ser. LNCS, vol. 6756. Springer, 2011, pp. 441-452, Available: arXiv:1103.4399 [cs.LO].
23. Ph. Schnoebelen, "Revisiting Ackermann-hardness for lossy counter machines and reset Petri nets," in MFCS 2010, ser. LNCS, vol. 6281. Springer, 2010, pp. 616-628.