CTL May Be Ambiguous When Model Checking Moore Machines - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

CTL May Be Ambiguous When Model Checking Moore Machines

Résumé

The model checking problem is defined over Kripke structures. However, hardware designers often handle other models, such as Moore machines. When model checking their designs using CTL as a logic, they must translate them into Kripke structures. A given CTL property may be believed to be true (conversely false) over the Moore machine and in fact be false (conversely true) on the derived Kripke structure. This may lead to ambiguities if the designer does not fully understand the translation scheme he uses, which may be the case if he uses automatic tools. We present iCTL, a logic specifically designed to work with Moore machines, which extends CTL to help the designer removing possible ambiguities when model checking Moore machines. We show that it is strictly more expressive than CTL.

Dates et versions

hal-01529835 , version 1 (31-05-2017)

Identifiants

Citer

Cédric Roux, Emmanuelle Encrenaz. CTL May Be Ambiguous When Model Checking Moore Machines. CHARME 2003 - 12th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods, Oct 2003, L'Aquila, Italy. pp.164-169, ⟨10.1007/978-3-540-39724-3_16⟩. ⟨hal-01529835⟩
32 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More