POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Now you may compose temporal logic specifications
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Reasoning about digital circuits
Reasoning about digital circuits
Theoretical issues in the design and verification of distributed systems
Theoretical issues in the design and verification of distributed systems
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
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
A Unified Model Checking Approach with Projection Temporal Logic
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
Complexity of propositional projection temporal logic with star†
Mathematical Structures in Computer Science
Axiomatic semantics of projection temporal logic programs†
Mathematical Structures in Computer Science
An improved decision procedure for propositional projection temporal logic
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Alternating interval based temporal logics
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
A transformation from PPTL to S1S
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
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
Asynchronous communication in MSVL
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
This paper investigates the language class defined by Propositional Projection Temporal Logic with star (PPTL with star). To this end, Büchi automata are first extended with stutter rule (SBA) to accept finite words. Correspondingly, ω-regular expressions are also extended (ERE) to express finite words. Consequently, by three transformation procedures between PPTL with star, SBA and ERE, PPTL with star is proved to represent exactly the full regular language.