The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Projection in Temporal Logic Programming
LPAR '94 Proceedings of the 5th International Conference on Logic Programming and Automated Reasoning
A Combination of Clausal and Non Clausal Temporal Logic Programs
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Compositional reasoning about projected and infinite time
ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
Reasoning about digital circuits
Reasoning about digital circuits
Completeness of temporal logics over infinite intervals
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
A framed temporal logic programming language
Journal of Computer Science and Technology
An automated approach to specification animation for validation
Journal of Systems and Software
Framed temporal logic programming
Science of Computer Programming
A relation-based method combining functional and structural testing for test case generation
Journal of Systems and Software
Decidability of propositional projection temporal logic with infinite models
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Model checking propositional projection temporal logic based on SPIN
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Propositional projection temporal logic, Büchi automata and ω-regular expressions
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A note on stutter-invariant PLTL
Information Processing Letters
An improved decision procedure for propositional projection temporal logic
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Expressiveness of propositional projection temporal logic with star
Theoretical Computer Science
Compositional verification with stutter-invariant propositional projection temporal logic
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume I
A cylinder computation model for many-core parallel computing
Theoretical Computer Science
A complete proof system for propositional projection temporal logic
Theoretical Computer Science
| Hi-index | 0.00 |
This paper investigates the complexity of Propositional Projection Temporal Logic with Star (PPTL*). To this end, Propositional Projection Temporal Logic (PPTL) is first extended to include projection star. Then, by reducing the emptiness problem of star-free expressions to the problem of the satisfiability of PPTL* formulas, the lower bound of the complexity for the satisfiability of PPTL* formulas is proved to be non-elementary. Then, to prove the decidability of PPTL*, the normal form, normal form graph (NFG) and labelled normal form graph (LNFG) for PPTL* are defined. Also, algorithms for transforming a formula to its normal form and LNFG are presented. Finally, a decision algorithm for checking the satisfiability of PPTL* formulas is formalised using LNFGs.