PDL over Accelerated Labeled Transition Systems

We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition systems labeled with regular expressions over action labels. We study the model checking and satisfiability decision problems. Through a notion of regular expression rewriting, we reduce these two problems to the corresponding ones of PDL in the traditional semantics (w.r.t. LTS). As for the complexity, both of problems are proved to be EXPSPACE-complete. Moreover, the program complexity of model checking problem turns out to be NLOGSPACEcomplete. Furthermore, we provide an axiomatization for PDL which involves Kleene Algebra as an Oracle. The soundness and completeness are shown.

• Type: Conference
• Year: 2008
• Where: TASE
• Authors: Taolue Chen, Jaco van de Pol, Yanjing Wang
• Keywords: Model Checking, Regular Expression, Software Engineering, TASE 2008, Transition Systems