• Citer

Petri nets with non-blocking arcs are difficult to analyze

par Raskin, Jean-François ;Van Begin, Laurent
Référence Electronic Notes in Theoretical Computer Science, 98, page (35-55)
Publication Publié, 2004-08

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

In this paper, we study the decidability of five problems on a class of extended Petri nets. The study of this class of extended Petri nets is motivated by the problem of parametric verification of multiple copies of processes that can communicate with a partially non-blocking rendez-vous. This kind of communications occurs in abstractions of multi-threaded JAVA programs. © 2004 Elsevier B.V. All rights reserved.