Abstract
We study data nets, a generalisation of Petri nets in which tokens carry data from linearly-ordered infinite domains and in which whole-place operations such as resets and transfers are possible. Data nets subsume several known classes of infinite-state systems, including multiset rewriting systems and polymorphic systems with arrays.
We show that coverability and termination are decidable for arbitrary data nets, and that boundedness is decidable for data nets in which whole-place operations are restricted to transfers. By providing an encoding of lossy channel systems into data nets without whole-place operations, we establish that coverability, termination and boundedness for the latter class have non-primitive recursive complexity. The main result of the paper is that, even for unordered data domains (i.e., with only the equality predicate), each of the three verification problems for data nets without whole-place operations has non-elementary complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Reisig, W.: Petri Nets: An Introduction. Springer, Heidelberg (1985)
Girault, C., Valk, R. (eds.): Petri Nets for Systems Engineering. Springer, Heidelberg (2003)
Esparza, J., Nielsen, M.: Decidability issues for Petri nets – a survey. Bull. EATCS 52, 244–262 (1994)
Lipton, R.J.: The reachability problem requires exponential space. Technical Report 62, Yale University (1976)
Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223–231 (1978)
Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing Petri net extensions. Inf. Comput. 195(1–2), 1–29 (2004)
Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Proc. Lett. 83(5), 251–261 (2002)
Odifreddi, P.: Classical Recursion Theory II. Elsevier, Amsterdam (1999)
Dufourd, C., Finkel, A., Schnoebelen, P.: Reset nets between decidability and undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103–115. Springer, Heidelberg (1998)
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)
Delzanno, G.: Constraint multiset rewriting. Technical Report DISI-TR-05-08, Università di Genova Extends [22–24] (2005)
Abdulla, P.A., Delzanno, G.: Constrained multiset rewriting. In: AVIS. ENTCS 2006 (to appear 2006)
Rosa Velardo, F., de Frutos Escrig, D., Marroquín Alonso, O.: On the expressiveness of mobile synchronizing Petri nets. In: SECCO. ENTCS 2005 (to appear 2005)
Abdulla, P.A., Jonsson, B.: Model checking of systems with many identical timed processes. Theor. Comput. Sci. 290(1), 241–264 (2003)
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91–101 (1996)
Lazić, R., Newcomb, T.C., Roscoe, A.W.: Polymorphic systems with arrays, 2-counter machines and multiset rewriting. In: Infinity ’04, ENTCS, vol. 138, pp. 61–86 (2005)
Lazić, R.: Decidability of reachability for polymorphic systems with arrays: A complete classification. In: Infinity ’04, ENTCS, vol. 138, pp. 3–19 ( 2005)
Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere? Theor. Comput. Sci. 256(1–2), 63–92 (2001)
Meyer, A.R.: Weak monadic second-order theory of successor is not elementary-recursive. In: Logic colloquium ’72–73. Lect. Not. Math, vol. 453, pp. 132–154. Springer, Heidelberg (1975)
Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Soc. (3) 2(7), 326–336 (1952)
Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. Acta Inf. 21, 643–674 (1985)
Delzanno, G.: An assertional language for systems parametric in several dimensions. In: VEPAS, ENTCS, vol. 50 (2001)
Bozzano, M., Delzanno, G.: Beyond parameterized verification. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, pp. 221–235. Springer, Heidelberg (2002)
Bozzano, M., Delzanno, G.: Automatic verification of invalidation-based protocols. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 295–308. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Lazić, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J. (2007). Nets with Tokens Which Carry Data. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-73094-1_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73093-4
Online ISBN: 978-3-540-73094-1
eBook Packages: Computer ScienceComputer Science (R0)