## Abstract

Partial order techniques enable reducing the size of the state space used for model checking, thus alleviating the "state space explosion" problem. These reductions are based on selecting a subset of the enabled operations from each program state. So far, these methods have been studied, implemented, and demonstrated for assertional languages that model the executions of a program as computation sequences, in particular the linear temporal logic. The present paper shows, for the first time, how this approach can be applied to languages that model the behavior of a program as a tree. We study here partial order reductions for branching temporal logics, e.g., the logics CTL and CTL* (with the next time operator removed) and process algebra logics such as Hennesy-Milner logic (with τ actions). Conditions on the selection of subset of successors from each state during the state-space construction, which guarantee reduction that preserves CTL* properties, are given. The experimental results provided show that the reduction is substantial.

Original language | English |
---|---|

Pages (from-to) | 132-152 |

Number of pages | 21 |

Journal | Information and Computation |

Volume | 150 |

Issue number | 2 |

DOIs | |

State | Published - 1 May 1999 |

Externally published | Yes |

### Bibliographical note

Funding Information:* Partially supported by ESPRIT project P6021, ‘‘Building Correct Reactive Systems (REACT).’’ -Partially supported by De stichting informatica-onderzoek in Nederland (SION). Part of this research was done when the fourth author was visiting Eindhoven University of Technology.

### Funding

* Partially supported by ESPRIT project P6021, ‘‘Building Correct Reactive Systems (REACT).’’ -Partially supported by De stichting informatica-onderzoek in Nederland (SION). Part of this research was done when the fourth author was visiting Eindhoven University of Technology.

Funders | Funder number |
---|---|

ESPRIT | P6021 |