2019
DOI: 10.1007/978-3-030-21759-4_9
|View full text |Cite
|
Sign up to set email alerts
|

Model Checking HPnGs in Multiple Dimensions: Representing State Sets as Convex Polytopes

Abstract: Hybrid Petri Nets with general transitions (HPnG) include general transitions that fire after a randomly distributed amount of time. Stochastic Time Logic (STL) expresses properties that can be model checked using a symbolic representation for sets of states as convex polytopes. Model checking then performs geometric operations on convex polytopes. The implementation of previous approaches was restricted to two stochastic firings. This paper instead proposes model checking algorithms for HPnGs with an arbitrar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
1
1

Relationship

3
3

Authors

Journals

citations
Cited by 9 publications
(12 citation statements)
references
References 31 publications
0
12
0
Order By: Relevance
“…While the NUM intervals method performs best in this setting, it can only be used to compute transient distributions. Model checking, as proposed in [33] requires geometric operations and hence, integration on polytopes.…”
Section: Computation and Validation Of Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…While the NUM intervals method performs best in this setting, it can only be used to compute transient distributions. Model checking, as proposed in [33] requires geometric operations and hence, integration on polytopes.…”
Section: Computation and Validation Of Resultsmentioning
confidence: 99%
“…for a predefined maximum time. As such, this paper provides the missing link to recent work [33,34] which provides model checking capabilities for HPnGs with multiple random variables, assuming the existence of the PLT.…”
mentioning
confidence: 99%
“…This article shows how the state-space of a Hybrid Petri net with multiple general transition firings can be constructed as a Parametric Location Tree (PLT) [24] for a predefined maximum time. As such, this article provides the missing link to recent work [33,34] that provides model checking capabilities for HPnGs with multiple random variables, assuming the existence of the PLT.…”
Section: Introductionmentioning
confidence: 99%
“…However, it is possible to compute a geometric representation for each location in a PLT [34] that fully relies on halfspace intersection, which can be solved e.g., using quickhull [4] also for higher dimensions. This combines the computational speed of the parametric reachability analysis with the ease that a geometric representation brings for model checking complex properties [33].…”
Section: Introductionmentioning
confidence: 99%
“…hpnmg The tool hpnmg [36] is a model checker for Hybrid Petri nets with an arbitrary but finite number of general transition firings against specifications formulated in STL [38]. Each general transition firing results in a random variable which follows a continuous probability distribution.…”
Section: Participating Tools and Frameworkmentioning
confidence: 99%