BOUNDED SELF-STABILIZING PETRI NETS

Citation
L. Cherkasova et al., BOUNDED SELF-STABILIZING PETRI NETS, Acta informatica, 32(3), 1995, pp. 189-207
Citations number
28
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
ISSN journal
00015903
Volume
32
Issue
3
Year of publication
1995
Pages
189 - 207
Database
ISI
SICI code
0001-5903(1995)32:3<189:BSPN>2.0.ZU;2-5
Abstract
We investigate the property of self-stabilization in bounded Petri net s. We give characterizations for both self-stabilizing bounded ordinar y Petri nets (i.e., Petri nets without multiple arcs) and self-stabili zing bounded general Petri nets (i.e., Petri nets with multiple arcs). These characterizations allow us to determine the complexity of decid ing self-stabilization for each of these classes. In particular, we sh ow the self-stabilization problem to be PTIME-complete for bounded ord inary Petri nets and PSPACE-complete for bounded general Petri nets.