Nets with tokens which carry data

Fundamenta Informaticae

Volumn 88, Issue 3, 2008, Pages 251-274

  Lazić, Ranko ^a,b   Newcomb, Tom ^c   Ouaknine, Joël ^c   Roscoe, A W ^c   Worrell, James ^c  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Computational complexity; Infinite state systems; Petri nets; Program verification

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; GRAPH THEORY; PETRI NETS;

BOUNDEDNESS; COVERABILITY; DATA DOMAINS; GENERALISATION; INFINITE DOMAINS; INFINITE-STATE SYSTEMS; LOSSY CHANNEL SYSTEMS; MULTISET REWRITING; POLYMORPHIC SYSTEMS; PROGRAM VERIFICATION; VERIFICATION PROBLEMS;

MARINE BIOLOGY;

EID: 58149508174     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (24)

1. Abdulla, P. A., Delzanno, G.: Constrained Multiset Rewriting, AVIS '06, ENTCS, to appear.
2. Abdulla, P. A., Jonsson, B.: Verifying Programs with Unreliable Channels, Inf. Comput., 127(2), 1996, 91-101.
3. Abdulla, P. A., Jonsson, B.: Model checking of systems with many identical timed processes, Theor. Comput. Sci., 290(1), 2003,241-264.
4. Abdulla, P. A., Nylén, A.: Timed Petri Nets and BQOs, ICATPN, number 2075 in LNCS, Springer, 2001.
5. Bozzano, M., Delzanno, G.: Automatic Verification of Invalidation-based Protocols, CAV, number 2404 in LNCS, Springer, 2002.
6. Bozzano, M., Delzanno, G.: Beyond Parameterized Verification, TACAS, number 2280 in LNCS, Springer, 2002.
7. Delzanno, G.: An Assertional Language for Systems Parametric in Several Dimensions, VEPAS, number 50 in ENTCS, 2001.
8. Delzanno, G.: Constraint Multiset Rewriting, Technical Report D1SI-TR-05-08, Universita di Genova, 2005, Extends [7, 6, 5].
9. Dufourd, C., Finkel, A., Schnoebelen, P: Reset Nets Between Decidability and Undecidability, ICALP, number 1443 in LNCS, Springer, 1998.
10. Esparza, J., Nielsen, M.: Decidability Issues for Petri Nets - a survey, Bull. EATCS, 52, 1994, 244-262.
11. Finkel, A., McKenzie, P., Picaronny, C: A well-structured framework for analysing Petri net extensions, Inf. Comput., 195(1-2), 2004, 1-29.
12. Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!, Theor. Comput. Sci, 256(1-2), 2001,63-92.
13. Girault, C., Valk, R., Eds.: Petri Nets for Systems Engineering, Springer, 2003.
14. Higman, G.: Ordering by divisibility in abstract algebras, Proc. London Math. Soc. (3), 2(7), 1952, 326-336.
15. Lazić, R.: Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification, Infinity '04, number 138 in ENTCS, 2005.
16. Lazić, R., Newcomb, T. C., Roscoe, A. W.: Polymorphic Systems with Arrays, 2-Counter Machines and Multiset Rewriting, Infinity '04, number 138 in ENTCS, 2005.
17. Lipton, R. J.: The Reachability Problem Requires Exponential Space, Technical Report 62, Yale University, 1976.
18. Meyer, A. R.: Weak monadic second-order theory of successor is not elementary-recursive, Logic colloquium '72-73, number 453 in Lect. Not. Math., Springer, 1975.
19. Odifreddi, P.: Classical Recursion Theory II, Elsevier, 1999.
20. Rackoff, C: The Covering and Boundedness Problems for Vector Addition Systems, Theor. Comput. Sci., 6, 1978,223-231.
21. Reisig, W.: Petri Nets: An Introduction, Springer, 1985.
22. Rosa Velardo, F., de Frutos Escrig, D., Marroquín Alonso, O.: On the expressiveness of Mobile Synchronizing Petri nets, SecCo '05, number 180 in ENTCS, 2007.
23. Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity, Inf. Proc. Lett., 83(5), 2002, 251-261.
24. Valk, R., Jantzen, M.: The Residue of Vector Sets with Applications to Decidability Problems in Petri Nets, Acta Inf., 21, 1985, 643-674.