Abstract
Nondeterminism occurs naturally in Petri nets whenever multiple events are enabled at the same time. Traditionally, it is resolved at specification time using probability weights and priorities. In this paper, we focus on model checking for hybrid Petri nets with an arbitrary but finite number of stochastic firings (HPnGs) while preserving the inherent nondeterminism as a first-class modelling and analysis feature. We present two algorithms to compute optimal non-prophetic and prophetic schedulers. The former can be applied to all HPnG models while the latter is only applicable if information on the firing times of general transitions is specifically encoded in the model. Both algorithms make use of recent work on the parametric location tree, which symbolically unfolds the state space of an HPnG. A running example illustrates the approach and confirms the feasibility of the presented algorithm.
Original language | English |
---|---|
Title of host publication | HSCC '20 |
Subtitle of host publication | Proceedings of the 23rd International Conference on Hybrid Systems: Computation and Control |
Editors | Aaron Ames, Sanjit A. Seshia, Jyotirmoy Deshmukh |
Place of Publication | New York, NY |
Publisher | Association for Computing Machinery |
Number of pages | 11 |
ISBN (Electronic) | 978-1-4503-7018-9 |
DOIs | |
Publication status | Published - 22 Apr 2020 |
Event | 23rd International Conference on Hybrid Systems: Computation and Control, HSCC 2020 - Hilton Sydney, Sydney, Australia Duration: 21 Apr 2020 → 24 Apr 2020 Conference number: 23 https://berkeleylearnverify.github.io/HSCC_2020/ |
Conference
Conference | 23rd International Conference on Hybrid Systems: Computation and Control, HSCC 2020 |
---|---|
Abbreviated title | HSCC 2020 |
Country/Territory | Australia |
City | Sydney |
Period | 21/04/20 → 24/04/20 |
Internet address |
Keywords
- hybrid Petri nets with general transitions
- Nondeterminism
- Prophetic schedulers
- Reachability analysis
- Stochastic hybrid systems
- 22/2 OA procedure