A Primitive Recursive Algorithm for the General Petri Net Reachability Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

A Primitive Recursive Algorithm for the General Petri Net Reachability Problem

Abstract

The general Petri net reachability problem is shown to be decidable in double exponential space. The previous algorithm is non-primitive recursive.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3404.pdf (228.23 Ko) Télécharger le fichier

Dates and versions

inria-00073286 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073286 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More