Reachabilty Analysis For Recursive Petri Nets With Shared Places

Djaouida Dahmani , Jean-Michel Ilié (1) , Malika Ioualalen

1 MoVe - Modélisation et Vérification

Recursive Petri Nets (RPN) are used to model systems composed of dynamic threads. In this paper, the proposed extensions improve the communications via global places and immediate transitions. For this new model called ERPN, we address the reachability problem in a modular approach. Because threads are dynamic, their abstractions requires to preserve traces of the ability to communicate. For the concern of infinite ERPNs, semantical constraints are proposed to ensure the termination of the reachability procedure.

Domaines: Informatique [cs]

Djaouida Dahmani, Jean-Michel Ilié, Malika Ioualalen. Reachabilty Analysis For Recursive Petri Nets With Shared Places. International Workshop on Abstractions for Petri nets Analysis and Other Models of Concurrency (APNOC'2009), in conjunction with the 30th Int. Conf. on Application and Theory of Petri Nets and Other Models of Concurrency (Petri Nets 2009), Jun 2009, Paris, France. pp.65-79. ⟨hal-01298269⟩