2009
DOI: 10.1007/978-3-642-04761-9_22
|View full text |Cite
|
Sign up to set email alerts
|

Don’t Know for Multi-valued Systems

Abstract: Abstract. This paper studies abstraction and refinement techniques in the setting of multi-valued model checking for the μ-calculus. Two dimensions of abstractions are identified and studied: Abstraction by joining states of the underlying multi-valued Kripke structure as well as abstraction of truth values, for each following both an optimistic and pessimistic account. It is shown that our notion of abstraction is conservative in the following sense: The truth value in a concrete system is "between" the optim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 14 publications
(17 reference statements)
0
2
0
Order By: Relevance
“…One of the earliest attempts for using games for CTL model checking has been proposed by Stirling [25]. Shoham and Grumberg [23,24,18,3] have extended this game-based approach for CTL over 3-valued semantics. In this work, we exploit and apply the game-based approach in a completely new direction, for automatic CTL verification of variability models.…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…One of the earliest attempts for using games for CTL model checking has been proposed by Stirling [25]. Shoham and Grumberg [23,24,18,3] have extended this game-based approach for CTL over 3-valued semantics. In this work, we exploit and apply the game-based approach in a completely new direction, for automatic CTL verification of variability models.…”
Section: Related Work and Conclusionmentioning
confidence: 99%
“…While usually overapproximations (or underapproximations) of systems are constructed and thus only purely universal (or existential) properties can be checked, [31] shows that using MTS one can check mixed formulae (arbitrarily combining universal and existential properties) and, moreover, at the same cost as checking universal properties using traditional conservative abstractions. This advantage has been investigated also in the context of systems equivalent or closely related to MTS [24,26,27,32,34,47] but parameters have not been used in this context.…”
Section: Introductionmentioning
confidence: 99%