Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm

Authors:
Petr Jančar
Affiliations:
Center of Applied Cybernetics, Department of Computer Science, Technical University of Ostrava (FEI VŠB-TUO), 17, listopadu 15, CZ-70833 Ostrava, Czech Republic
Venue:
Information and Computation
Year:
2008

Citing 5
Cited 0

Decidability and Complexity of Petri Net Problems - An Introduction

Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
A Primitive Recursive Algorithm for the General Petri Net Reachability Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Decidability of reachability in vector addition systems (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An algorithm for the general Petri net reachability problem

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Reachability of nonsynchronized choice Petri nets and its applications

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The proceedings of FOCS'98 contain a paper by Zakariae Bouziane, who sketches a new representation of the Petri net reachability problem and claims to provide a new algorithm solving the problem. In this note, the essence of Bouziane's approach is explained, and a serious flaw of the algorithm is exposed.