Arrow Research search

Author name cluster

Mengfei Yang

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

2 papers
1 author row

Possible papers

2

FM Conference 2026 Conference Paper

Automated LTL Specification Generation from Industrial Aerospace Requirements

  • Zhi Ma
  • Xiao Liang
  • Cheng Wen
  • Rui Chen
  • Bin Gu
  • Shengchao Qin
  • Cong Tian
  • Mengfei Yang

Abstract In the development and verification of safety-critical aero-space software, Linear Temporal Logic (LTL) has been widely used to specify complex system properties derived from requirements. However, a significant gap remains in industrial practice: translating natural language (NL) requirements into formal LTL properties is a labor-intensive and error-prone process that requires rare expertise in both aerospace control engineering and formal methods. While recent NL-to-LTL tools ( e. g. , NL2SPEC, NL2TL, NL2LTL) are capable of automating parts of this process, they often fail on real requirement documents in industrial settings, due to complex domain terminology or implicit temporal and logical structure. To address these challenges, we present Aero Req2LTL, a framework that automates LTL property generation for aerospace requirements using large language models (LLMs), with two key industrial innovations: (i) a data dictionary that normalizes technical jargon into precise atomic propositions; and (ii) a template-based requirement language that makes temporal cues and logical relations explicit before translation. On a real aerospace dataset, Aero Req2LTL achieves 85% precision and 88% recall in LTL generation, and its outputs can be directly consumed by existing verification tools.

TCS Journal 2025 Journal Article

SAT-based bounded model checking for propositional projection temporal logic

  • Zhenhua Duan
  • Cong Tian
  • Nan Zhang
  • Chaofeng Yu
  • Mengfei Yang
  • Jia He

This paper presents a bounded model checking (BMC) approach for propositional projection temporal logic (PPTL). To this end, first PPTL is briefly introduced. Then, bounded semantics of PPTL is defined according to its semantics in logic theory. Further, a reduction method from BMC to SAT is given in detail. In addition, an example is presented to illustrate how the approach works. Finally, miniSAT is employed to solve the SAT based BMC problem by means of verifying RMS algorithm in detail. Our experience shows that SAT based BMC approach for PPTL proposed in the paper is useful and feasible.

v2026.09.13