Decidability border for Petri nets with data: WQO dichotomy conjecture

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

Volumn 9698, Issue , 2016, Pages 20-36

  Lasota, Sławomir ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; PETRI NETS;

BOUNDEDNESS; COVERABILITY; DATA DOMAINS; DECISION PROBLEMS; REACHABILITY PROBLEM; TOTAL ORDER; WELL QUASI ORDERINGS; WELL-STRUCTURED TRANSITION SYSTEMS;

PROBLEM SOLVING;

EID: 84977596410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-39086-4_3     Document Type: Conference Paper

References (26)

1. Abdulla, P.A., Nylèn, A.: Timed petri nets and BQOs. In: Colom, J.-M., Koutny, M. (eds.) ICATPN 2001. LNCS, vol. 2075, pp. 53–70. Springer, Heidelberg (2001)
2. Bojańczyk, M., Braud, L., Klin, B., Lasota, S.: Towards nominal computation. In: Proceedings of the POPL, pp. 401–412 (2012)
3. Bojańczyk, M., Klin, B., Lasota, S.: Automata theory in nominal sets. Logical Methods Comput. Sci. 10(3), 1–44 (2014). Paper 4
4. Bojańczyk, M., Klin, B., Lasota, S., Toruńczyk, S.: Turing machines with atoms. In: LICS, pp. 183–192 (2013)
5. Cervesato, I., Durgin, N.A., Lincoln, P., Mitchell, J.C., Scedrov, A.: A metanotation for protocol analysis. In: Proceedings of the CSFW 1999, pp. 55–69 (1999)
6. Cherlin, G.: The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments. Memoirs of the American Mathematical Society, vol. 621. American Mathematical Society (1998)
7. Clemente, L., Lasota, S.: Reachability analysis of first-order definable pushdown systems. In: Proceedings of the CSL 2015, pp. 244–259 (2015)
8. Delzanno, G.: An overview of MSR(C): a clp-based framework for the symbolic verification of parameterized concurrent systems. Electr. Notes Theor. Comput. Sci. 76, 65–82 (2002)
9. Delzanno, G.: Constraint multiset rewriting. Technical report DISI-TR-05-08, DISI, Università di Genova (2005)
10. Finkel, A., Goubault-Larrecq, J.: Forward analysis for wsts, part I: completions. In: Proceedings of the STACS 2009, pp. 433–444 (2009)
11. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere! Theor. Comput. Sci. 256(1–2), 63–92 (2001)
12. Fraïssè, R.: Theory of Relations. North-Holland (1953)
13. Genrich, H.J., Lautenbach, K.: System modelling with high-level petri nets. Theor. Comput. Sci. 13, 109–136 (1981)
14. Haddad, S., Schmitz, S., Schnoebelen, P.: The ordinal-recursive complexity of timed-arc Petri nets, data nets, and other enriched nets. In: Proceedings of the LICS 2012, pp. 355–364 (2012)
15. Henson, W.: Countable homogeneous relational structures and ℵ0-categorical theories. J. Symb. Logic 37, 494–500 (1972)
16. Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3) 2(7), 326–336 (1952)
17. Hofman, P., Lasota, S., Lazic, R., Leroux, J., Schmitz, S., Totzke, P.: Coverability trees for petri nets with unordered data. In: Jacobs, B., Löding, C. (eds.) FOSSACS 2016. LNCS, vol. 9634, pp. 445–461. Springer, Heidelberg (2016). doi:10.1007/978-3-662-49630-5-26
18. Jacobsen, L., Jacobsen, M., Moller, M.H., Srba, J.: Verification of timed-arc petri nets. In: Černà, I., Gyimòthy, T., Hromkovič, J., Jefferey, K., Kràlović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 46–72. Springer, Heidelberg (2011)
19. Jensen, K.: Coloured petri nets and the invariant-method. Theor. Comput. Sci. 14, 317–336 (1981)
20. Klin, B., Szynwelski, M.: SMT solving for functional programming over infinite structures. In: Mathematically Structured Functional Programming (accepted for publication, 2016)
21. Kopczyński, E., Toruńczyk, S.: LOIS: an application of SMT solvers (submitted, 2016). http://www.mimuw.edu.pl/∼erykk/lois/lois-sat.pdf
22. Kruskal, J.B.: Well-quasi-ordering, the tree theorem, and Vazsonyi’s conjecture. Trans. Am. Math. Soc. 95(2), 210–225 (1960)
23. Latka, B.J.: Finitely constrained classes of homogeneous directed graphs. J. Symbolic Logic 59(1), 124–139 (1994)
24. Lazić, R.S., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.B.: Nets with tokens which carry data. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 301–320. Springer, Heidelberg (2007)
25. Macpherson, D.: A survey of homogeneous structures. Discrete Math. 311(15), 1599–1634 (2011)
26. Rosa-Velardo, F., de Frutos-Escrig, D.: Decidability and complexity of petri nets with unordered data. Theor. Comput. Sci. 412(34), 4439–4451 (2011)