A practical decision procedure for Propositional Projection Temporal Logic with infinite models
Zhenhua Duan,Cong Tian +1 more
Reads0
Chats0
TLDR
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.About:
This article is published in Theoretical Computer Science.The article was published on 2014-10-16 and is currently open access. It has received 42 citations till now. The article focuses on the topics: Propositional variable & Well-formed formula.read more
Citations
More filters
Journal ArticleDOI
A canonical form based decision procedure and model checking approach for propositional projection temporal logic
Zhenhua Duan,Cong Tian,Nan Zhang +2 more
TL;DR: A Canonical Form (CF) for chop formulas of Propositional Projection Temporal Logic (PPTL) is proposed and an improved algorithm for constructing Labeled Normal Form Graph (LNFG) of a PPTL formula is presented, leading to a better decision procedure for P PTL with infinite models.
Journal ArticleDOI
Model checking concurrent systems with MSVL
Nan Zhang,Zhenhua Duan,Cong Tian +2 more
TL;DR: Computer scientists have made significant progress to the original model checking, with the most significant improvements being compositional, partial order, symbolic, bounded, bounded and abstract model checking.
Journal ArticleDOI
A Novel Approach to Modeling and Verifying Real-Time Systems for High Reliability
TL;DR: The unified model checking approach to verifying real-time systems via dynamical program execution is implemented and a timed modeling, simulation, and verification language (TMSVL) for real- time systems is defined.
Journal ArticleDOI
Verifying temporal properties of programs: A parallel approach
TL;DR: A parallel approach to verify full regular temporal properties of a program using a Propositional Projection Temporal Logic formula and takes full advantage of the hardware resources and makes temporal property verification efficient in a multi-core system.
Proceedings ArticleDOI
Full regular temporal property verification as dynamic program execution
Meng Wang,Cong Tian,Zhenhua Duan +2 more
TL;DR: A unified model checking approach is presented in this paper where a program to be verified is written in a Modeling, Simulation and Verification Language (MSVL) program M and a desired property is specified by a Propositional Projection Temporal Logic (PPTL) formula P.
References
More filters
Proceedings ArticleDOI
The temporal logic of programs
TL;DR: A unified approach to program verification is suggested, which applies to both sequential and parallel programs, and the main proof method is that of temporal reasoning in which the time dependence of events is the basic concept.
Book
The Formal Semantics of Programming Languages: An Introduction
TL;DR: The Formal Semantics of Programming Languages" provides the basic mathematical techniques necessary for those who are beginning a study of semantics and logics of programming languages, including the vital area of concurrency.
Book
Executing Temporal Logic Programs
TL;DR: This paper presents temporal logic as a tool for reasoning about computer programs, digital circuits and message-passing systems and investigates its role as an adjunct to existing languages.
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.
Dissertation
An extended interval temporal logic and a framing technique for temporal logic programming
TL;DR: This thesis presents a framing technique for temporal logic programming, which includes the definitions of new assignments, the assignment flag and the framing operator, the formalization of algebraic properties of the framingoperator, the minimal model semantics of framed programs, as well as an executable framed interpreter.