SEQUENCE-INDEXED LINEAR-TIME TEMPORAL LOGIC: PROOF SYSTEM AND APPLICATION

  • Authors:
  • Ken Kaneiwa;Norihiro Kamide

  • Affiliations:
  • Department of Electrical Engineering and Computer Science, Iwate University, Japan;Waseda Institute for Advanced Study, Waseda University, Tokyo, Japan

  • Venue:
  • Applied Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.03

Visualization

Abstract

We propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temporal logic (SLTL), is obtained semantically from standard linear-time temporal logic (LTL) by adding a sequence modal operator that represents a sequence of symbols. By this sequence modal operator, we can appropriately express message flows between clients and servers and states of servers in temporal reasoning. A Gentzen-type sequent calculus for SLTL is introduced, and the completeness and cut-elimination theorems for it are proved. SLTL is also shown to be PSPACE-complete and embeddable into LTL.