Decidability analysis of self-stabilization for infinite-state systems

Authors:
Hsu-Chun Yen;Lien-Po Yu
Affiliations:
Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.;Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.
Venue:
Fundamenta Informaticae
Year:
2005

Citing 12
Cited 0

Logspace hierarchies, polynomial time and the complexity of fairness problems concerning &ohgr;-machines

SIAM Journal on Computing
On questions of fairness and temporal logic for conflict-free Petri nets

Advances in Petri Nets 1988
The instability of self-stabilization

Acta Informatica
A theory of timed automata

Theoretical Computer Science
Bounded self-stabilizing Petri nets

Acta Informatica
Unreliable channels are easier to verify than perfect channels

Information and Computation
Undecidable verification problems for programs with unreliable channels

Information and Computation
Properties of Conflict-Free and Persistent Petri Nets

Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Undecidable problems in unreliable computations

Theoretical Computer Science - Latin American theoretical informatics
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Model checking lossy vector addition systems

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a variety of infinite-state systems, the problem of deciding whether a given system is self-stabilizing or not is investigated from the decidability viewpoint. We develop a unified strategy through which checking self-stabilization is shown to be decidable for lossy vector addition systems with states, one-counter machines, and conflict-free Petri nets. For lossy counter machines and lossy channel systems, in contrast, the self-stabilization problem is shown to be undecidable.