1. Decomposition of Automata PDL and its Extension.
- Author
-
Xinxin Liu and Bingtian Xue
- Subjects
MACHINE theory ,MATHEMATICAL decomposition ,BISIMULATION ,COINDUCTION (Mathematics) ,FIXED point theory - Abstract
In this work we study the decomposition problem of automata PDL and one of its extension. We proved that automata PDL enjoys a good decomposition property under a very large class of process context, while this problem is more complicated for regular PDL, which has an exponential blow-up. We introduce proposition identifiers to automata PDL to obtain a language which has a good balance between expressiveness and ease of analysis. We prove that this extended specification language still has a good decomposition property for a large class of process contexts. After that we present a method to solve the weak bisimulation equations as an application of the extended language, by combining the decomposition property and the decision procedure proposed in [1]. [ABSTRACT FROM AUTHOR]
- Published
- 2012