Parametrised Verification of Class of Resource Allocation systems - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Parametrised Verification of Class of Resource Allocation systems

Résumé

The present work deal with two problems concerning behavioural properties for a large class of resource allocation systems (RAS) called G-systems generalising well-known models presented in the literature. The first problem is the well-formedness characterisation. It consists to prove the existence of an initial marking ensuring non-blockingness (from any state reachable from initial state, it is always possible to reach a desirable (or final) state). The second problem consists to show that under appropriate supervision non-blockingness of G-sytems can also be always ensured. Using structure theory of Petri nets, we state, a structural and parameterised characterisation for these two problems. In particular, the proposed solution for the second problem can be interpreted as a synthesis of a parameterised and modular supervisor.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01124902 , version 1

Citer

Kamel Barkaoui, Jabr Romhain. Parametrised Verification of Class of Resource Allocation systems. Actes de la Conférence Internationale sur la Productique, CIP’03, CDTA - Alger, Jan 2003, X, France. pp.52-59. ⟨hal-01124902⟩

Collections

CNAM CEDRIC-CNAM
25 Consultations
0 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More