Advertisement
Published in:
2008 | OriginalPaper | Chapter
Propositional Projection Temporal Logic, Bchi Automata and ω-Regular Expressions
Authors : Cong Tian, Zhenhua Duan
Published in: Theory and Applications of Models of Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.