Description

• Title:
  Extended full computation-tree logics for paraconsistent model checking
• Creator:
  Kamide, Norihiro
• Description:
  It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework.
• Object availability:
  free access
• Rights:
  Prawa autorskie (c) 2017 Logic and Logical Philosophy
• Date:
  2007.03.15
• Type:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Language:
  English
• Source:
  Logic and Logical Philosophy; Vol. 15 No. 3 (2006); 251-276;
  Logic and Logical Philosophy; Tom 15 Nr 3 (2006); 251-276;
  2300-9802;
  1425-3305
• Format:
  application/pdf
• Publisher:
  Uniwersytet Mikołaja Kopernika w Toruniu
• Relation: https://apcz.umk.pl/LLP/article/view/LLP.2006.015/1492
• Subject:
  bisimulation;
  full computation-tree logic;
  location operator;
  paraconsistent model checking
• Identifier: https://apcz.umk.pl/LLP/article/view/LLP.2006.015
• Data provider:
  Akademicka Platforma Czasopism
• Can I use it?:
  seek permission
• Type:
  text