Hybrid and Hybrid Adaptive Petri Nets: On the computation of a Reachability Graph. (May 2015)

• Record Type: Journal Article
• Authors: Fraca, Estíbaliz; Júlvez, Jorge; Silva, Manuel
• Is Part Of: Nonlinear analysis. Volume 16(2015)
• Page Start: 24
• Page End: 39
• Publication Date: 2015-05
• Subjects: Petri Nets -- Hybrid Petri Nets -- Hybrid Adaptive Petri Nets -- Reachability -- Reachability Graph -- Discrete event systems modelling; Nonlinear functional analysis -- Periodicals; Analyse fonctionnelle non linéaire -- Périodiques; Nonlinear functional analysis; Periodicals; 515.7248
• DOI: 10.1016/j.nahs.2014.11.005
• Languages: English
• ISSNs: 1751-570X

Abstract

Abstract: Petri Nets (PNs) constitute a well known family of formalisms for the modelling and analysis of Discrete Event Dynamic Systems (DEDS). As general formalisms for DEDS, PNs suffer from the state explosion problem. A way to alleviate this difficulty is to relax the original discrete model and deal with a fully or partially continuous model. In Hybrid Petri Nets (HPNs), transitions can be either discrete or continuous, but not both. In Hybrid Adaptive Petri Nets (HAPNs), each transition commutes between discrete and continuous behaviour depending on a threshold: if its load is higher than its threshold, it behaves as continuous; otherwise, it behaves as discrete. This way, transitions adapt their behaviour dynamically to their load. This paper proposes a method to compute the Reachability Graph (RG) of HPNs and HAPNs.