A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets - Archive ouverte HAL Access content directly
Conference Papers Year : 1992

A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets

Abstract

Voir le lien ici
No file

Dates and versions

hal-01125465 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01125465 , version 1

Cite

Kamel Barkaoui, M. Minoux. A Polynomial-Time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. Application and Theory of Petri Nets, Jan 1992, X, France. pp.62-75. ⟨hal-01125465⟩

Collections

CNAM CEDRIC-CNAM
21 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More