1018 search results - page 51 / 204 » Abstraction and Refinement in Model Checking |
86
Voted
CAV
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We present an unfolding-based approach to LTL-X modelchecking of high-level Petri nets. It is based on the method proposed by Esparza and Heljanko for low-level nets [4, ...
108
click to vote
SPIN
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...
107
Voted
FM
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...
121
Voted
ECAI
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We investigate the problem of the verification of multiagent systems by means of parallel algorithms. We present algorithms for CTLK, a logic combining branching time tem...
87
Voted
CHARME
2005
Springer
15 years 6 months ago
2005
Springer
Abstraction is the key for effectively dealing with the state explosion in model-checking. Unfortunately, finding abstractions which are small and yet enable us to get conclusive ...