Finite-trace linear temporal logic: coinductive completeness
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2086683
- Constructive finite trace analysis with linear temporal logic
- scientific article; zbMATH DE number 1088203
- scientific article; zbMATH DE number 2047494
- A finitary-language semantics for propositional linear temporal logic
- scientific article; zbMATH DE number 1848280
- Linear temporal logic -- from infinite to finite horizon
- Decidability and incompleteness results for first-order temporal logics of linear time
- An expressively complete linear time temporal logic for Mazurkiewicz traces
Cites work
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 1304310 (Why is no real title available?)
- scientific article; zbMATH DE number 3316966 (Why is no real title available?)
- An axiomatic basis for computer programming
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- An incomplete decidable modal logic
- Comparing LTL semantics for runtime verification
- Constructive finite trace analysis with linear temporal logic
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- LTL is expressively complete for Mazurkiewicz traces
- Mathematical modal logic: A view of its evolution
- One-path reachability logic
- Propositional dynamic logic of regular programs
- Propositional temporal logics: decidability and completeness
- Temporal logic can be more expressive
- Temporal verification of reactive systems: response
- The complexity of propositional linear temporal logics
- Two Complete Axiom Systems for the Algebra of Regular Events
- Using temporal logics to express search control knowledge for planning
- \(\mathrm{LTL}_{f}\) satisfiability checking
Cited in
(10)- A tableau construction for finite linear-time temporal logic
- Towards a unifying logical framework for neural networks
- scientific article; zbMATH DE number 2047494 (Why is no real title available?)
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- Linear temporal logic -- from infinite to finite horizon
- LTL on finite and process traces: complexity results and a practical reasoner
- Constructive finite trace analysis with linear temporal logic
- scientific article; zbMATH DE number 1088203 (Why is no real title available?)
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- Introduction to the special issue on runtime verification
This page was built for publication: Finite-trace linear temporal logic: coinductive completeness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1667649)
