Finite-trace linear temporal logic: coinductive completeness
From MaRDI portal
Publication:1667649
DOI10.1007/s10703-018-0321-3zbMath1394.68237OpenAlexW2901540136MaRDI QIDQ1667649
Publication date: 30 August 2018
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-018-0321-3
Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)
Related Items
A tableau construction for finite linear-time temporal logic, Towards a unifying logical framework for neural networks, Introduction to the special issue on runtime verification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
- Propositional dynamic logic of regular programs
- Mathematical modal logic: A view of its evolution
- LTL is expressively complete for Mazurkiewicz traces
- Using temporal logics to express search control knowledge for planning
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- Constructive Finite Trace Analysis with Linear Temporal Logic
- Temporal logic can be more expressive
- Comparing LTL Semantics for Runtime Verification
- Temporal Verification of Reactive Systems: Response
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- An incomplete decidable modal logic
- The complexity of propositional linear temporal logics
- Propositional temporal logics: decidability and completeness
- All-Path Reachability Logic
- One-Path Reachability Logic
- Two Complete Axiom Systems for the Algebra of Regular Events
- An axiomatic basis for computer programming
