2022
DOI: 10.1007/978-3-031-07727-2_12
|View full text |Cite
|
Sign up to set email alerts
|

HyperPCTL Model Checking by Probabilistic Decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 24 publications
0
1
0
Order By: Relevance
“…In this paper, for the sake of simplicity, we avoid such an involved construction and consider only single, uncoupled computation trees, where all atomic propositions share the same state variable specified in the probability expression. However, handling such constraints would require only an additional technical step performing the cross-product when needed [37], and no principle obstacles.…”
Section: Controller Quantification (ϕ)mentioning
confidence: 99%
“…In this paper, for the sake of simplicity, we avoid such an involved construction and consider only single, uncoupled computation trees, where all atomic propositions share the same state variable specified in the probability expression. However, handling such constraints would require only an additional technical step performing the cross-product when needed [37], and no principle obstacles.…”
Section: Controller Quantification (ϕ)mentioning
confidence: 99%