# Bounded self-stabilizing Petri nets

Conference paper

First Online:

## Abstract

We investigate the property of self-stabilization in bounded Petri nets. We give characterizations for both self-stabilizing bounded ordinary Petri nets (i.e., Petri nets without multiple arcs) and self-stabilizing bounded general Petri nets (i.e., Petri nets with multiple arcs). These characterizations allow us to determine the complexity of deciding self-stabilization for each of these classes. In particular, we show the self-stabilization problem to be PTIME-complete for bounded ordinary Petri nets and PSPACE-complete for bounded general Petri nets.

## Keywords

Self-stabilization bounded Petri nets computational complexity## Preview

Unable to display preview. Download preview PDF.

## References

- [BGW89]G. Brown, M. Gouda, and C. Wu. Token systems that self-stabilize.
*IEEE Trans. on Computers*, 38:845–852, 1989.Google Scholar - [BP89]J. Burns and J. Pachl. Uniform self-stabilizing rings.
*ACM Trans. on Programming Languages and Systems*, 11:330–344, 1989.Google Scholar - [BYC88]F. Bastani, I. Yen, and I. Chen. A class of inherently fault tolerant distributed programs.
*IEEE Trans. on Software Engineering*, 14:1432–1442, 1988.Google Scholar - [Dij73]E. Dijkstra. EWD391 Self-stabilization in spite of distributed control, 1973. Reprinted in
*Selected Writings on Computing: A Personal Perspective*, Springer-Verlag, Berlin, 1982, pp. 41–46.Google Scholar - [Dij74]E. Dijkstra. Self stabilizing systems in spite of distributed control.
*Communications of the ACM*, 17:643–644, 1974.Google Scholar - [GHR90]M. Gouda, R. Howell, and L. Rosier. The instability of self-stabilization.
*Acta Informatica*, 27:697–724, 1990.Google Scholar - [Gou90]M. Gouda. The stabilizing philosopher: Asymmetry by memory and by action, 1990. To appear in
*Science of Computer Programming*.Google Scholar - [HJR91]R. Howell, P. Jančar, and L. Rosier. Single-path Petri nets. In
*Proceedings of the 16 International Symposium on Mathematical Foundations of Computer Science*, pages 202–210, 1991. LNCS 520. To appear in*Information and Computation*.Google Scholar - [How91]R. Howell. The complexity of problems concerning structurally bounded and conservative Petri nets.
*Information Processing Letters*, 39:309–315, 1991.Google Scholar - [HP79]J. Hopcroft and J. Pansiot. On the reachability problem for 5-dimensional vector addition systems.
*Theoret. Comput. Sci.*, 8:135–159, 1979.Google Scholar - [HR87]R. Howell and L. Rosier. Recent results on the complexity of problems related to petri nets. In G. Rozenberg, editor,
*Advances in Petri Nets 1987*, pages 45–72. Springer, 1987. LNCS 266.Google Scholar - [HR88]R. Howell and L. Rosier. Completeness results for conflict-free vector replacement systems.
*J. Comput. System Sci.*, 37:349–366, 1988.Google Scholar - [HRY87]R. Howell, L. Rosier, and H. Yen. An O(n
^{1.5}) algorithm to decide boundedness for conflict-free vector replacement systems.*Inform. Process. Lett.*, 25:27–33, 1987.Google Scholar - [HRY89]R. Howell, L. Rosier, and H. Yen. Normal and sinkless Petri nets. In
*Proceedings, 7th International Conference on Fundamentals of Computation Theory*, pages 234–243, 1989. LNCS 380. To appear in*J. Comput. System Sci.*Google Scholar - [JL77]N. Jones and W. Laaser. Complete problems for deterministic polynomial time.
*Theoret. Comp. Sci.*, 3:105–117, 1977.Google Scholar - [JLL77]N. Jones, L. Landweber, and Y. Lien. Complexity of some problems in Petri nets.
*Theoret. Comput. Sci.*, 4:277–299, 1977.Google Scholar - [Kar72]R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors,
*Complexity of Computer Computations*, pages 85–103. Plenum Press, 1972.Google Scholar - [Kar84]N. Karmarkar. A new polynomial-time algorithm for linear programming.
*Combinatorica*, 4:373–395, 1984.Google Scholar - [Kha79]L. Khachian. A polynomial algorithm in linear programming.
*Dokl. Akad. Nauk. SSSR*, 244:1093–1096, 1979. In Russian. English translation in*Soviet Math. Dokl.*, 20:191–194.Google Scholar - [KM69]R. Karp and R. Miller. Parallel program schemata.
*J. Comput. System Sci.*, 3:147–195, 1969.Google Scholar - [Kos82]R. Kosaraju. Decidability of reachability in vector addition systems. In
*Proceedings, 14th ACM Symposium on Theory of Computing*, pages 267–280, 1982.Google Scholar - [Lam86]L. Lamport. The mutual exclusion problem: Part II — Statement and solutions.
*JACM*, 33:327–348, 1986.Google Scholar - [Lam88]J. Lambert. Consequences of the decidability of the reachability problem for Petri nets. In G. Rozenberg, editor,
*Advances in Petri Nets 1988*, pages 266–282. Springer, Berlin, 1988. LNCS 340. An expanded version to appear in*Theoret. Comput. Sci.*Google Scholar - [Lip76]R. Lipton. The reachability problem requires exponential space. Technical Report 62, Yale University, Dept. of CS., Jan. 1976.Google Scholar
- [May84]E. Mayr. An algorithm for the general Petri net reachability problem.
*SIAM J. Comput.*, 13:441–460, 1984. A preliminary version of this paper was presented at the “13th ACM Symposium on Theory of Computing,” 1981.Google Scholar - [Mul89]N. Multari.
*Self-stabilizing Protocols*. PhD thesis, Dept. of Computer Sciences, University of Texas at Austin, 1989.Google Scholar - [Mur89]T. Murata. Petri nets: properties, analysis, and applications.
*Proc, of the IEEE*, 77:541–580, 1989.Google Scholar - [Rac78]C. Rackoff. The covering and boundedness problems for vector addition systems.
*Theoret. Comput. Sci.*, 6:223–231, 1978.Google Scholar - [Sil85]M. Silva. Las
*Redes de Petri: en la Automatica y la Informatica*. Editorial AC, Madrid, 1985. ISBN 84 7288 045 1.Google Scholar

## Copyright information

© Springer-Verlag Berlin Heidelberg 1993