Book ChapterDOI
Model checking propositional projection temporal logic based on SPIN
Cong Tian,Zhenhua Duan +1 more
- pp 246-265
Reads0
Chats0
TLDR
This paper investigates a model checking algorithm for Propositional Projection Temporal Logic with finite models by transforming a PPTL formula to a Normal Form Graph, and then a Nondeterministic Finite Automaton (NFA).Abstract:
This paper investigates a model checking algorithm for Propositional Projection Temporal Logic (PPTL) with finite models. To this end, a PPTL formula is transformed to a Normal Form Graph (NFG), and then a Nondeterministic Finite Automaton (NFA). The NFA precisely characterizes the finite models satisfying the corresponding formula and can be equivalently represented as a Deterministic Finite Automaton (DFA). When the system to be verified can be modeled as a DFA As, and the property of the system can be specified by a PPTL formula P, then ¬P can be transformed to a DFA Ap. Thus, whether the system satisfies the property or not can be checked by computing the product automaton of As and Ap, and then checking whether or not the product automaton accepts the empty word. Further, this method can be implemented by means of the verification system SPIN.read more
Citations
More filters
Journal ArticleDOI
A decision procedure for propositional projection temporal logic with infinite models
Zhenhua Duan,Cong Tian,Li Zhang +2 more
TL;DR: This paper investigates the satisfiability of Propositional Projection Temporal Logic with infinite models, and Normal Form and Labeled Normal Form Graph for PPTL formulas are defined and finiteness of LNFGs is proved.
Journal ArticleDOI
Expressiveness of propositional projection temporal logic with star
Cong Tian,Zhenhua Duan +1 more
TL;DR: This paper investigates the expressiveness of Propositional Projection Temporal Logic with Star (PPTL), and by equivalent transformations among PPTL* formulas, SBAs and EREs, P PTL* is proved to represent exactly the full regular language.
Journal ArticleDOI
Complexity of propositional projection temporal logic with star
Cong Tian,Zhenhua Duan +1 more
TL;DR: The lower bound of the complexity for the satisfiability of PPTL* formulas is proved to be non-elementary, and a decision algorithm for checking the satisfiable formulas is formalised using LNFGs.
Journal ArticleDOI
A practical decision procedure for Propositional Projection Temporal Logic with infinite models
Zhenhua Duan,Cong Tian +1 more
TL;DR: A practical decision procedure for Propositional Projection Temporal Logic with infinite models using the generalized Buchi accepting condition for automata to identify a path in an LNFG as a model of the formula.
Journal ArticleDOI
A complete proof system for propositional projection temporal logic
TL;DR: The paper presents a proof system for Propositional Projection Temporal Logic with projection-plus with an axiom system consisting of axioms and inference rules and some of the frequently used theorems are proved.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
The model checker SPIN
TL;DR: An overview of the design and structure of the verifier, its theoretical foundation, and an overview of significant practical applications are given.
Book ChapterDOI
A Temporal Logic of Nested Calls and Returns
TL;DR: This work introduces a temporal logic of calls and returns (CaRet) for specification and algorithmic verification of correctness requirements of structured programs and presents a tableau construction that reduces the model checking problem to the emptiness problem for a Buchi pushdown system.