کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
438172 690234 2014 22 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A practical decision procedure for Propositional Projection Temporal Logic with infinite models
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
A practical decision procedure for Propositional Projection Temporal Logic with infinite models
چکیده انگلیسی

This paper presents a practical decision procedure for Propositional Projection Temporal Logic with infinite models. First, a set ProplPropl of labels lili, 0⩽i⩽n∈N00⩽i⩽n∈N0, is used to mark nodes of an LNFG of a formula, and a node with lili is treated as an accepting state as in an automaton. Further, the generalized Büchi accepting condition for automata is employed to identify a path (resulting a word) in an LNFG as a model of the formula. In addition, the implementation details of the decision procedure and relevant algorithms including pre-processing, LNFG, circle finding algorithms are presented; as a matter of fact, all algorithms are implemented by C++ programs.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 554, 16 October 2014, Pages 169–190
نویسندگان
, ,