Thumbnail - Request a copy

Modular Verification of Petri nets properties: a Structure-based Approach

Klai, Kais; Haddad, Serge; Ilié, Jean-Michel (2005), Modular Verification of Petri nets properties: a Structure-based Approach, dans Wang, Farn, Formal Techniques for Networked and Distributed Systems - FORTE 2005 Formal Techniques for Networked and Distributed Systems - FORTE 2005 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings, Springer : Berlin, p. 189-203. http://dx.doi.org/10.1007/11562436_15

Type
Communication / Conférence
Date
2005
Titre du colloque
25th International Conference on Formal Techniques for Networked and Distributed Systems, FORTE 2005
Date du colloque
2005-10
Ville du colloque
Taipei
Pays du colloque
Taïwan
Titre de l'ouvrage
Formal Techniques for Networked and Distributed Systems - FORTE 2005 Formal Techniques for Networked and Distributed Systems - FORTE 2005 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005, Proceedings
Auteurs de l’ouvrage
Wang, Farn
Éditeur
Springer
Titre de la collection
Lecture Notes in Computer Science
Numéro dans la collection
3731
Ville d’édition
Berlin
Isbn
978-3-540-29189-3
Nombre de pages
558
Pages
189-203
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Klai, Kais
Haddad, Serge
Ilié, Jean-Michel
Résumé (EN)
In this paper, we address the modular verification problem for a Petri net obtained by composition of two subnets. At first, we show how to transform an asynchronous composition into a synchronous one where the new subnets are augmented from the original ones by means of linear invariants. Then we introduce a non-constraining relation between subnets based on their behaviour. Whenever this relation is satisfied, standard properties like the liveness and the boundedness and generic properties specified by a linear time logic may be checked by examination of the augmented subnets in isolation. Finally, we give a sufficient condition for this relation which can be detected modularly using an efficient algorithm.
Mots-clés
Abstraction; modular verification; (de)composition; Petri nets