## Abstract

Partial order techniques enable reducing the size of the state graph 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 logic LTL (linear temporal logic). The 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∗ (all logics with the next-time operator removed) and process algebras such as CCS. Conditions on the subset of successors from each node to guarantee reduction that preserves CTL properties are given. Provided experimental results show that the reduction is substantial.

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

Title of host publication | Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 130-139 |

Number of pages | 10 |

ISBN (Electronic) | 0818669152, 9780818669156 |

DOIs | |

State | Published - 1995 |

Externally published | Yes |

Event | 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 - Tel Aviv, Israel Duration: 4 Jan 1995 → 6 Jan 1995 |

### Publication series

Name | Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems |
---|

### Conference

Conference | 3rd Israel Symposium on the Theory of Computing and Systems, ISTCS 1995 |
---|---|

Country/Territory | Israel |

City | Tel Aviv |

Period | 4/01/95 → 6/01/95 |

### Bibliographical note

Publisher Copyright:© 1995 IEEE.

### Funding

*Partially supported by ESPRIT project P6021: Correct Reactive Systems (REACT)”.

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

ESPRIT | P6021 |