Journal
NONLINEAR ANALYSIS-HYBRID SYSTEMS
Volume 16, Issue -, Pages 24-39Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.nahs.2014.11.005
Keywords
Petri Nets; Hybrid Petri Nets; Hybrid Adaptive Petri Nets; Reachability; Reachability Graph; Discrete event systems modelling
Categories
Funding
- CICYT-FEDER grant of the Spanish Government [DPI2010-20413]
- European Social Fund
- Gobierno de Aragon [B174/11]
- [T27-GISED]
Ask authors/readers for more resources
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. (C) 2014 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available