Constraint LTL satisfiability checking without automata
From MaRDI portal
Publication:472802
DOI10.1016/j.jal.2014.07.005zbMath1310.68141arXiv1205.0946OpenAlexW2162541148MaRDI QIDQ472802
Publication date: 20 November 2014
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.0946
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items (8)
An SMT-based approach to satisfiability checking of MITL ⋮ Constraint LTL satisfiability checking without automata ⋮ On the initialization of clocks in timed formalisms ⋮ A temporal logic for micro- and macro-step-based real-time systems: foundations and applications ⋮ A logical characterization of timed regular languages ⋮ Trace-Length Independent Runtime Monitoring of Quantitative Policies in LTL ⋮ Using formal verification to evaluate the execution time of Spark applications ⋮ A tool for deciding the satisfiability of continuous-time metric temporal logic
Uses Software
Cites Work
- Constraint LTL satisfiability checking without automata
- An automata-theoretic approach to constraint LTL
- A theory of timed automata
- Decidable fragments of first-order temporal logics
- Bounded model checking of infinite state systems
- Model-checking CTL* over flat Presburger counter systems
- Completeness of the Bounded Satisfiability Problem for Constraint LTL
- The Effects of Bounding Syntactic Resources on Presburger LTL
- The complexity of propositional linear temporal logics
- A really temporal logic
- Foundations of Software Science and Computation Structures
- Linear Encodings of Bounded LTL Model Checking
- CONCUR 2005 – Concurrency Theory
- Verification, Model Checking, and Abstract Interpretation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constraint LTL satisfiability checking without automata
