Filters








64 Hits in 2.3 sec

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

Agnieszka M. Zbrzezny
2017 Scientific Issues Jan Długosz University in Częstochowa Mathematics  
Moreover, the both methods use the same bounded semantics of ECTL * formulae, the compatible encodings of the transition systems and the compatible translations of ECTL * formulae.  ...  We have implemented the both methods and made some preliminary experimental results which shows that generally the SAT-based method is superior to the SMT-based method.  ...  The first translation from ECTL to SAT was introduced in [21] and then it was substantially improved in [25] .  ... 
doi:10.16926/m.2017.22.12 fatcat:simjievx5rgqnhfmxta56sfqdu

Comparing sat-based bounded model checking rtectl and ectl properties

Agnieszka M. Zbrzezny
2017 Technical Sciences  
computation tree logic (ECTL).  ...  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  ...  Acknowledgements The author wishes to thank Bożena Woźna-Szcześniak and Andrzej Zbrzezny for valuable comments and numerous suggestions which helped to improve this paper.  ... 
doi:10.31648/ts.5147 fatcat:j5qqoikwijcwlarn2wqx2mcqbu

Bounded Model Checking Approaches for Verification of Distributed Time Petri Nets

Artur Meski, Agata Pólrola, Wojciech Penczek, Bozena Wozna-Szczesniak, Andrzej Zbrzezny
2011 Applications and Theory of Petri Nets  
We give a translation of BMC to SAT and describe a BDD-based BMC for both LTL−X and ECTL−X.  ...  We focus on the properties expressed in Linear Temporal Logic without the neXt-time operator (LTL−X) and the existential fragment of Computation Tree Logic without the neXt-time operator (ECTL−X).  ...  In case of SAT we exploit the most efficient translations known for ECTL −X and ELTL −X .  ... 
dblp:conf/apn/MeskiPPWZ11 fatcat:wjp7u6h7qfhebgb3zekgcnsq74

Symbolic Model Checking without BDDs [chapter]

Armin Biere, Alessandro Cimatti, Edmund Clarke, Yunshan Zhu
1999 Lecture Notes in Computer Science  
Symbolic Model Checking [3, 14] has proven to be a powerful technique for the verification of reactive systems. BDDs [2] have traditionally been used as a symbolic representation of the system.  ...  We introduce a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.  ...  The first format is the DIMACS format [10] for satisfiability problems. The SATO tool [18] is a very efficient implementation of the Davis & Putnam Procedure [7] and it uses the DIMACS format.  ... 
doi:10.1007/3-540-49059-0_14 fatcat:gmqrogonfjgnlouuklzk37mk74

Evaluation of SAT-based Bounded Model Checking of ACTL Properties

Yanyan Xu, Wei Chen, Liang Xu, Wenhui Zhang
2007 First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (TASE '07)  
that this is the first attempt to have an implementation of a method that combines practical error detection and verification of ACTL properties by SAT-based model checking.  ...  Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years.  ...  With all these points, now we are able to translate the model checking problem to the bounded model checking problem and we can solve the latter problem with a stateof-the-art SAT solver.  ... 
doi:10.1109/tase.2007.22 dblp:conf/tase/XuCXZ07 fatcat:soyzgebj7rbblafiwwbnca4yey

Satisfiability of ECTL* with Tree Constraints [chapter]

Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2015 Lecture Notes in Computer Science  
In contrast, we introduce Ehrenfeucht-Fraïssé-games for WMSO+B (weak MSO with the bounding quantifier) and use them to show that our approach cannot deal with the class of order trees.  ...  Recently, we proved that satisfiability for ECTL * with constraints over Z is decidable using a new technique based on weak monadic second-order logic with the bounding quantifier (WMSO+B).  ...  We also write SAT-ECTL * (A) instead of SAT-ECTL * ({A}).  ... 
doi:10.1007/978-3-319-20297-6_7 fatcat:757llstgmvgcvbzr247if57esu

Satisfiability of ECTL ⁎ with constraints

Claudia Carapelle, Alexander Kartzow, Markus Lohrey
2016 Journal of computer and system sciences (Print)  
Since ECTL * is a proper extension of CTL * this greatly improves the previously known decidability results for certain fragments of CTL * , e.g., the existential and positive fragments and EF.  ...  We also show that our choice of local constraints is necessary for the result in the sense that if we add the possibility to state non-local constraints over Z the resulting logic becomes undecidable.  ...  We are grateful to Szymon Toruńczyk for fruitful discussions.  ... 
doi:10.1016/j.jcss.2016.02.002 fatcat:4f4sqyppqfatrl64ekhptrzxfe

External cavity wavelength tunable semiconductor lasers - a review

B. Mroziewicz
2008 Opto-Electronics Review  
The present review has been restricted to the systems based on the edge emitting diode lasers set-up in a hybrid configuration.  ...  The aim was to make the paper as concise as possible without sacrificing, however, most important details.  ...  Acknowledgements The author would like to thank Dr E. Kowalczyk for his assistance in the measurements involved with the subjects described in the paper.  ... 
doi:10.2478/s11772-008-0045-9 fatcat:kjpvuuobqzhmtlx3flohxgqucq

Satisfiability of ECTL* with tree constraints [article]

Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2015 arXiv   pre-print
As a consequence, a different approach has to be taken in order to settle the question whether satisfiability of ECTL^* (or even LTL) with constraints over the infinite (order) tree is decidable.  ...  This approach reduces the satisfiability problem of ECTL^* with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called  ...  We also write SAT-ECTL * (A) instead of SAT-ECTL * ({A}).  ... 
arXiv:1412.2905v2 fatcat:s4ummmiogjapxmfz7dc4tzzkhi

On Boolean Encodings of Transition Relation for Parallel Compositions of Transition Systems

Andrzej Zbrzezny
2013 International Workshop on Concurrency, Specification and Programming  
We compare the encodings considered by applying them to the SAT-based bounded model checking (BMC) of ECTL * properties.  ...  We present and compare different Boolean encodings of the transition relation for the parallel composition of transition systems, both for the asynchronous and the synchronous semantics.  ...  of ECTL * formulae to SAT.  ... 
dblp:conf/csp/Zbrzezny13 fatcat:y6sbrc5lkfcjzbnfzmru352fhi

Model Checking CTL is Almost Always Inherently Sequential

Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer, Neil Immerman
2011 Logical Methods in Computer Science  
We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL+, and ECTL+.  ...  The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)).  ...  As for the corresponding satisfiability problems CTL-SAT(T, B) and CTL ⋆ -SAT(T, B), their complexity has been determined-with respect to the set of Boolean operators, completely-in [MMTV09] .  ... 
doi:10.2168/lmcs-7(2:12)2011 fatcat:usi56ija3bcunpwzau4fkqgewm

Model Checking CTL is Almost Always Inherently Sequential

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
2009 2009 16th International Symposium on Temporal Representation and Reasoning  
We also completely determine the complexity of the model checking problem for all fragments of the extensions ECTL, CTL + , and ECTL + .  ...  For the extensions CTL + and ECTL + , the situation is more complex. In general, model checking CTL + and ECTL + is ∆ p 2 -complete [LMS01].  ...  As for the corresponding satisfiability problems CTL-SAT(T, B) and CTL ⋆ -SAT(T, B), their complexity has been determined-with respect to the set of Boolean operators, completely-in [MMTV09] .  ... 
doi:10.1109/time.2009.12 dblp:conf/time/BeyersdorffMTVMS09 fatcat:yiavdk6rirhfthgqnfz5eeqpgu

Satisfiability of ECTL∗ with Local Tree Constraints

Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
2017 Theory of Computing Systems  
This approach reduces the satisfiability problem of ECTL * with constraints over some structure A (or class of structures) to the problem whether A has a certain model theoretic property that we called  ...  As a consequence, our technique cannot be used to establish whether satisfiability of ECTL * with constraints over the infinite (order) tree is decidable.  ...  We also write SAT-ECTL * (C) instead of SAT-ECTL * ({C}).  ... 
doi:10.1007/s00224-016-9724-y fatcat:ug3hlwxqwrhrxjbsyxdn6dksaa

BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance

Artur Mȩski, Wojciech Penczek, Maciej Szreter, Bożena Woźna-Szcześniak, Andrzej Zbrzezny
2013 Autonomous Agents and Multi-Agent Systems  
Two translations of BMC for ELTLK to SAT and to operations on BDDs are presented.  ...  The paper deals with symbolic approaches to bounded model checking (BMC) for the existential fragment of linear temporal logic extended with the epistemic component (ELTLK), interpreted over interleaved  ...  and the source are credited.  ... 
doi:10.1007/s10458-013-9232-2 fatcat:jlonqvhembdz7ir4latydkfibq

Model Checking with SAT-Based Characterization of ACTL Formulas [chapter]

Wenhui Zhang
2007 Lecture Notes in Computer Science  
used as the theoretical basis for SAT-based bounded model checking [2, 18] .  ...  Dually, the sublogic ECTL is the subset of CTL formulas that can be transformed into NNF formulas not containing the temporal operators AX, AF, AG, AU, AR. Definition 2.  ...  ACKNOWLEDGMENTS: The author thanks anonymous referees for their constructive critics that helped improving this paper.  ... 
doi:10.1007/978-3-540-76650-6_12 fatcat:skzkemc5vbcnnlqb7uvgt7y3c4
« Previous Showing results 1 — 15 out of 64 results