Completeness of the Bounded Satisfiability Problem for Constraint LTL-Reference-Cited by-同舟云学术

Completeness of the Bounded Satisfiability Problem for Constraint LTL

Published:2011 Issue: Volume: Page:58-71
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bersani Marcello M.,Frigeri Achille,Rossi Matteo,San Pietro Pierluigi

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24288-5_7

Reference9 articles.

1. Bersani, M.M., Frigeri, A., Morzenti, A., Pradella, M., Rossi, M., San Pietro, P.: Bounded reachability for temporal logic over constraint systems. In: Markey, N., Wijsen, J. (eds.) TIME, pp. 43–50. IEEE Computer Society, Los Alamitos (2010)

2. Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Advances in Computers 58, 118–149 (2003)

3. Lecture Notes in Computer Science;E.M. Clarke,2004

4. Lecture Notes in Computer Science;H. Comon,2000

5. Demri, S., D’Souza, D.: An automata-theoretic approach to constraint LTL. Inf. Comput. 205(3), 380–415 (2007)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An SMT-based approach to satisfiability checking of MITL;Information and Computation;2015-12

2. A tool for deciding the satisfiability of continuous-time metric temporal logic;Acta Informatica;2015-04-21

3. A Timed Semantics of Workflows;Communications in Computer and Information Science;2015

4. Constraint LTL satisfiability checking without automata;Journal of Applied Logic;2014-12

5. Fuzzy Time in Linear Temporal Logic;ACM Transactions on Computational Logic;2014-08