An enumerative approach for analyzing Time Petri Nets - Équipe Verification de Systèmes Temporisés Critiques Accéder directement au contenu
Communication Dans Un Congrès Année : 1983

An enumerative approach for analyzing Time Petri Nets

Résumé

This paper is concerned with specifying and proving correct systems in which time appears as a parameter. We model such systems via Merlin's Time Petri Nets. An enumerative analysis technique is introduced for these nets based on the computation of a set of state classes and a reachability relation on the set. State classes are defined in the text and an algorithm is provided for their enumeration. This enumerative approach allows us to derive a finite representation of their behavior for a large family of Time Petri Nets. The analysis method is illustrated by the analysis of a communication protocol.
Fichier principal
Vignette du fichier
ifip83tex.pdf (122.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04187100 , version 1 (25-08-2023)

Identifiants

  • HAL Id : hal-04187100 , version 1

Citer

Bernard Berthomieu, Miguel Menasche. An enumerative approach for analyzing Time Petri Nets. IFIP 9th World Computer Congress, Sep 1983, Paris, France. ⟨hal-04187100⟩
37 Consultations
29 Téléchargements

Partager

Gmail Facebook X LinkedIn More