2021
DOI: 10.1007/978-981-16-7443-3_6
|View full text |Cite
|
Sign up to set email alerts
|

Computation Tree Logic Model Checking over Possibilistic Decision Processes Under Finite-Memory Scheduler

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 21 publications
0
0
0
Order By: Relevance
“…Computation tree logic (CTL) [1], a type of temporal logic, is an essential specification language in formal verification, especially in model checking [2,3]. CTL is usually used to describe properties (or specifications) that the current system needs to satisfy.…”
Section: Introductionmentioning
confidence: 99%
“…Computation tree logic (CTL) [1], a type of temporal logic, is an essential specification language in formal verification, especially in model checking [2,3]. CTL is usually used to describe properties (or specifications) that the current system needs to satisfy.…”
Section: Introductionmentioning
confidence: 99%