Greedy Model Checking

Poul Frederick Williams, Antoine Rauzy

Publikation: Bog / Antologi / Rapport / Ph.D.-afhandlingRapportForskning

Abstract

We present a model checking method which greedily explores the state space. Using ideas similar to greedy satisfiability checking, our method tries to fit a path to match a temporal specification. The advantages of this method is that we do not need any quantifications, we do not calculate a reachable (neither forward nor backward) set of states, and the memory requirements are quite small.
OriginalsprogEngelsk
UdgivelsesstedCopenhagen
ForlagIT-Universitetet i København
UdgaveTR-2000-2
Antal sider10
ISBN (Elektronisk)87-7949-002-6
StatusUdgivet - okt. 2000
Udgivet eksterntJa
NavnIT University Technical Report Series
NummerTR-2000-2
ISSN1600-6100

Fingeraftryk

Dyk ned i forskningsemnerne om 'Greedy Model Checking'. Sammen danner de et unikt fingeraftryk.

Citationsformater