Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: computational tree logic

Sortuj według:

Ogranicz wyniki do:

Comparing SAT- and SMT- based bounded model checking for Ectl properties

Zbrzezny A. M.

Scientific Issues of Jan Długosz University in Częstochowa. Mathematics

2017

Vol. 22

161--175

We compare two bounded model checking methods for properties expressed in the existential fragment of Computation Tree Logic (Ectl). To this end we use the generic pipeline paradigm (GPP) and the train controller system (TC), the classic concurrency problems, which we formalise by means of a finite transition system. We consider several properties of the problems that can be expressed in Ectl logic, and we present the performance evaluation of the mentioned bounded model checking methods by means of the running time and the memory used.