Skip to Main content Skip to Navigation
Reports

A Primitive Recursive Algorithm for the General Petri Net Reachability Problem

Zakaria Bouziane 1
1 PAMPA - Models and Tools for Programming Distributed Parallel Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00073286
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 12:26:18 PM
Last modification on : Thursday, February 11, 2021 - 2:48:04 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:41:17 PM

Identifiers

  • HAL Id : inria-00073286, version 1

Citation

Zakaria Bouziane. A Primitive Recursive Algorithm for the General Petri Net Reachability Problem. [Research Report] RR-3404, INRIA. 1998. ⟨inria-00073286⟩

Share

Metrics

Record views

437

Files downloads

722