We propose a partial order reduction technique for timed automaton model checking in this paper. We first show that the symbolic successors w.r.t. partial order paths can be computed using DBMs. An algorithm is presented to compute such successors incrementally. This algorithm can avoid splitting the symbolic states because of the enumeration order of independent transitions. A reachability analysis algorithm based on this successor computation algorithm is presented. Our technique can be combined with some static analysis techniques in the literate. Further more, we present a rule to avoid exploring all enabled transitions, thus the space requirements of model checking are further reduced. © 2008 Springer-Verlag.
CITATION STYLE
Jianhua, Z., Linzhang, W., & Xuandong, L. (2008). A partial order reduction technique for parallel timed automaton model checking. In Communications in Computer and Information Science (Vol. 17 CCIS, pp. 262–276). Springer Verlag. https://doi.org/10.1007/978-3-540-88479-8_19
Mendeley helps you to discover research relevant for your work.