New Efficient Petri Nets Reductions for Parallel Programs Verification - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Processing Letters Année : 2006

New Efficient Petri Nets Reductions for Parallel Programs Verification

Résumé

Structural model abstraction is a powerful technique for reducing the complexity of a state based enumeration analysis. We present in this paper new efficient Petri nets reductions. First, we define `behavioural'' reductions (i.e. based on conditions related to the language f the net) which preserve a fundamental property of a net (i.e. liveness) and any formula of the (action-based) linear time logic that does not observe reduced transitions of the net. We show how to substitute these conditions by structural or algebraical ones leading to reductions that can be efficiently checked and applied whereas enlarging the application spectrum of the previous reductions. At last, we illustrate our method on a significant and typical example of synchronisation pattern of parallel programs.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01125149 , version 1

Citer

Serge Haddad, Jean-François Pradat-Peyre. New Efficient Petri Nets Reductions for Parallel Programs Verification. Parallel Processing Letters, 2006, 16, pp.101-116. ⟨hal-01125149⟩

Collections

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

Partager

Gmail Facebook X LinkedIn More