POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
A model and temporal proof system for networks of processes
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Behavior: A Temporal Approach to Process Modelling
Proceedings of the Conference on Logic of Programs
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
Framed temporal logic programming
Science of Computer Programming
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity of propositional projection temporal logic with star†
Mathematical Structures in Computer Science
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
Alternating interval based temporal logics
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
| Hi-index | 5.23 |
This paper investigates the expressiveness of Propositional Projection Temporal Logic with Star (PPTL*). To this end, Buchi automata and @w-regular expressions are first extended as Stutter Buchi Automata (SBA) and Extended Regular Expressions (ERE) to include both finite and infinite strings. Further, by equivalent transformations among PPTL* formulas, SBAs and EREs, PPTL* is proved to represent exactly the full regular language. Moreover, some fragments of PPTL* are characterized, and finally, PPTL* and its fragments are classified into five different language classes.