The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems

Woźna-Szcześniak, Bożena; Zbrzezny, Agnieszka M.; Zbrzezny, Andrzej

doi:10.1007/978-3-642-24769-9_40

Cited by 12 publications

(9 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section we define the SMT-based BMC method for the existential fragment of RTCTL (RTECTL) [9]. Similarly to SAT-based BMC, the SMT-based BMC is based on the notion of the bounded semantics for RTECTL ( [10]) in which one inductively defines for every s ∈ S the relation |= k .…”

Section: Smt-based Bounded Model Checkingmentioning

confidence: 99%

See 1 more Smart Citation

Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking

Zbrzezny

2015

Distributed Computing and Artificial Intelligence, 12th International Conference

Self Cite

View full text Add to dashboard Cite

Abstract. We present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method for the same systems and the same property language on several benchmarks for STSs. For the SAT-based BMC we used the PicoSAT solver and for the SMT-based BMC we used the Z3 solver. The experimental results show that the SMT-based BMC performs quite well and is, in fact, sometimes significantly faster than the tested SAT-based BMC.

show abstract

Section: Smt-based Bounded Model Checkingmentioning

confidence: 99%

“…Verification of soft real-time systems is an actively developing field of research [2,9,10]. Popular models of such systems include, among others, timed automata [1], and simply-timed systems (STSs) [5], i.e., Kripke models where each transition holds a duration, which can be any integer value (including zero).…”

Section: Introductionmentioning

confidence: 99%

Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking

Zbrzezny

2015

Distributed Computing and Artificial Intelligence, 12th International Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this section we define the SMT-based BMC method for the existential fragment of RTCTL (RTECTL) [9]. Similarly to SAT-based BMC, the SMT-based BMC is based on the notion of the bounded semantics for RTECTL ( [10] For every , the relation (the bounded semantics) is defined inductively as follows: …”

Section: Smt-based Bounded Model Checkingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Checking RTECTL properties of STSs via SMT-based Bounded Model Checking

Zbrzezny¹,

Zbrzezny²

2015

IJIMAI

Self Cite

View full text Add to dashboard Cite

-We present an SMT-based bounded model checking (BMC) method for Simply-Timed Systems (STSs) and for the existential fragment of the Real-time Computation Tree Logic. We implemented the SMT-based BMC algorithm and compared it with the SAT-based BMC method for the same systems and the same property language on several benchmarks for STSs. For the SATbased BMC we used the PicoSAT solver and for the SMT-based BMC we used the Z3 solver. The experimental results show that the SMT-based BMC performs quite well and is, in fact, sometimes significantly faster than the tested SAT-based BMC.

show abstract

“…The existential fragment of the soft real-time CTL (RTECTL) (EMERSON et al 1992) defeats this restriction by introducing time-bounded temporal operators, and it supplies a much more compact and convenient way of expressing time-bounded properties. The purpose of this paper is to compare the SAT-based BMC of RTECTL (WOŹNA-SZCZEŚNIAK et al 2011) properties and the SAT-based BMC of equivalent ECTL (ZBRZEZNY 2008) properties and to present a correct and complete translation from RTECTL to ECTL.…”

Section: Introductionmentioning

confidence: 99%

Comparing sat-based bounded model checking rtectl and ectl properties

Zbrzezny

2017

View full text Add to dashboard Cite

We compare two SAT-based bounded model checking algorithms for the properties expressed in the existential fragment of a soft real-time computation tree logic (RTECTL) and 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 both RTECTL and ECTL, and we present the performance evaluation of the mentioned bounded model checking methods by means of the running time and the memory used.

show abstract

The BMC Method for the Existential Part of RTCTLK and Interleaved Interpreted Systems

Cited by 12 publications

References 11 publications

Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking

Checking RTECTL Properties of STSs via SMT-Based Bounded Model Checking

Checking RTECTL properties of STSs via SMT-based Bounded Model Checking

Comparing sat-based bounded model checking rtectl and ectl properties

Contact Info

Product

Resources

About