Constraint LTL satisfiability checking without automata-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Constraint LTL satisfiability checking without automata

Published:2014-12 Issue:4 Volume:12 Page:522-557
ISSN:1570-8683
Container-title:Journal of Applied Logic
language:en
Short-container-title:Journal of Applied Logic

Author:

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

Funder

IDEAS-ERC

Publisher

Elsevier BV

Subject

Applied Mathematics,Logic

Reference34 articles.

1. A theory of timed automata;Alur;Theor. Comput. Sci.,1994

2. A really temporal logic;Alur;J. ACM,1994

3. SMT-based verification of LTL specification with integer constraints and its application to runtime checking of service substitutability;Bersani,2010

4. Completeness of the bounded satisfiability problem for constraint LTL;Bersani,2011

5. A tool for deciding the satisfiability of continuous-time metric temporal logic;Bersani,2013

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

1. Early Verification of Legal Compliance via Bounded Satisfiability Checking;Computer Aided Verification;2023

2. On the initialization of clocks in timed formalisms;Theoretical Computer Science;2020-04

3. Using formal verification to evaluate theexecution time of Spark applications;Formal Aspects of Computing;2020-02

4. A logical characterization of timed regular languages;Theoretical Computer Science;2017-01

5. A temporal logic for micro- and macro-step-based real-time systems: Foundations and applications;Theoretical Computer Science;2016-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP