## Efficient Simplification of Bisimulation Formulas (1995)

Venue: | In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 111--132. LNCS 1019 |

Citations: | 1 - 0 self |

### BibTeX

@INPROCEEDINGS{Engberg95efficientsimplification,

author = {Uffe H. Engberg and Kim S. Larsen},

title = {Efficient Simplification of Bisimulation Formulas},

booktitle = {In Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, pages 111--132. LNCS 1019},

year = {1995},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

The problem of checking or optimally simplifying bisimulation formulas is likely to be computationally very hard. We take a different view at the problem: we set out to define a very fast algorithm, and then see what we can obtain. Sometimes our algorithm can simplify a formula perfectly, sometimes it cannot. However, the algorithm is extremely fast and can, therefore, be added to formula-based bisimulation model checkers at practically no cost. When the formula can be simplified by our algorithm, this can have a dramatic positive effect on the better, but also more time consuming, theorem provers which will finish the job. 1 Introduction The need for validity checking or optimal simplification of first order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of value-passing calculi [4, 9, 15]. The NP-completeness of checking satisfiability of propositional formulas [3] implies that validity checking of that class of formulas is co-NP complete. Addit...

### Citations

3458 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ...n the first stage, symbolic transition graphs (a generalization of the standard notion of labeled transition graphs) are generated from terms of some value-passing language, say the full CCS calculus =-=[14]-=-. The two graphs are symbolic bisimilar [4, 9, 10] iff the two terms are bisimilar in traditional sense. Below, two processes are shown together with their associated graphs. Following [14], 0 is the ... |

838 | The complexity of theorem-proving procedures
- Cook
- 1971
(Show Context)
Citation Context ...order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of value-passing calculi [4, 9, 15]. The NP-completeness of checking satisfiability of propositional formulas =-=[3]-=- implies that validity checking of that class of formulas is co-NP complete. Additionally, checking of quantified formulas is P-space hard [7], so there is not much hope for a fast algorithm for decid... |

620 |
Data Structures and Network Algorithms
- Tarjan
- 1983
(Show Context)
Citation Context ...union (undo) the last union before processing E 0 . Path compressions are impossible to undo without ruining the complexity, so we only use union by rank, and obtain a complexity of O(log n) per find =-=[18]-=-. In order to undo the unions, each union operation is registered on a stack. In this way, deunions can be done in constant time (unions are still constant time). These three operations, find, union, ... |

269 |
Efficiency of a good but not linear set union algorithm
- Tarjan
- 1975
(Show Context)
Citation Context ...is an instance of the so-called disjoint set problem, which is usually solved using rooted trees [6]. To obtain the best possible performance, path compression (McIllroy and Morris) and union by rank =-=[17]-=- (or similar schemes) are normally used to obtain an amortized complexity of O(A \Gamma1 (n)) per find operation [17, 19], where A \Gamma1 is the inverse of the (unary) Ackermann function [1]. However... |

237 |
A dichromatic framework for balanced trees
- Guibas, Sedgewick
- 1978
(Show Context)
Citation Context ... by simply popping the stack. In order to access the stacks associated with variable names as fast as possible, variable names (along with the pointer to the stacks) are organized in a red-black tree =-=[2, 8]-=-, which is one of the efficient implementations of dictionaries with a complexity of O(log n) per operation, where n is the number of elements in the tree. To summarize, we use a red-black tree that h... |

110 |
Leeuwen. Worst-case analysis of set union algorithms
- Tarjan, van
- 1984
(Show Context)
Citation Context ...est possible performance, path compression (McIllroy and Morris) and union by rank [17] (or similar schemes) are normally used to obtain an amortized complexity of O(A \Gamma1 (n)) per find operation =-=[17, 19]-=-, where A \Gamma1 is the inverse of the (unary) Ackermann function [1]. However, when processing formulas like (x j y ! E)E 0 , we need to first form the union of the equivalence classes of x and y, t... |

60 |
Zum Hilbertschen Aufbau der reellen Zahlen
- Ackermann
- 1928
(Show Context)
Citation Context ...by rank [17] (or similar schemes) are normally used to obtain an amortized complexity of O(A \Gamma1 (n)) per find operation [17, 19], where A \Gamma1 is the inverse of the (unary) Ackermann function =-=[1]-=-. However, when processing formulas like (x j y ! E)E 0 , we need to first form the union of the equivalence classes of x and y, then process the expression E, and then deunion (undo) the last union b... |

35 |
Data structures
- Mehlhorn, Tsakalidis
- 1990
(Show Context)
Citation Context ...alysis. However, the size of the overhead is so large that for formulas that we consider (up to approximately 5Mbytes), this method is slower. For further details on disjoint set implementations, see =-=[13]-=-. We call the structure we use a union-find-deunion (UFD) structure. For formulas without universal quantification, this would be all we would need. However, formulas like (8x : E)sE 0 require that th... |

32 | Proof Systems for Message-Passing Process Alge- bras
- Hennessy, Lin
- 1993
(Show Context)
Citation Context ...s (a generalization of the standard notion of labeled transition graphs) are generated from terms of some value-passing language, say the full CCS calculus [14]. The two graphs are symbolic bisimilar =-=[4, 9, 10]-=- iff the two terms are bisimilar in traditional sense. Below, two processes are shown together with their associated graphs. Following [14], 0 is the process having no actions, whereas the prefixed pr... |

28 | M.J.: An improved equivalence algorithm
- Springer, Fisher
- 1964
(Show Context)
Citation Context ...ns are to make two variables equivalent and to test whether two variables are already equivalent. This is an instance of the so-called disjoint set problem, which is usually solved using rooted trees =-=[6]-=-. To obtain the best possible performance, path compression (McIllroy and Morris) and union by rank [17] (or similar schemes) are normally used to obtain an amortized complexity of O(A \Gamma1 (n)) pe... |

15 |
R.E.: Amortized analysis of algorithms for set union with backtracking
- Westbrook, Tarjan
- 1989
(Show Context)
Citation Context ...ime). These three operations, find, union, and deunion, can also be implemented such that the amortized complexity for the find operation becomes O(log n=(log log n)). That proposal is from [12]. See =-=[20]-=- for the analysis. However, the size of the overhead is so large that for formulas that we consider (up to approximately 5Mbytes), this method is slower. For further details on disjoint set implementa... |

7 |
E.: The set union problem with backtracking
- Mannila, Ukkonen
- 1986
(Show Context)
Citation Context ...constant time). These three operations, find, union, and deunion, can also be implemented such that the amortized complexity for the find operation becomes O(log n=(log log n)). That proposal is from =-=[12]-=-. See [20] for the analysis. However, the size of the overhead is so large that for formulas that we consider (up to approximately 5Mbytes), this method is slower. For further details on disjoint set ... |

2 |
Verification of Value-Passing Systems
- Schreiber
- 1992
(Show Context)
Citation Context ...ob. 1 Introduction The need for validity checking or optimal simplification of first order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of value-passing calculi =-=[4, 9, 15]-=-. The NP-completeness of checking satisfiability of propositional formulas [3] implies that validity checking of that class of formulas is co-NP complete. Additionally, checking of quantified formulas... |

1 |
Symmetric Binary B-Trees
- Bayer
- 1972
(Show Context)
Citation Context ... by simply popping the stack. In order to access the stacks associated with variable names as fast as possible, variable names (along with the pointer to the stacks) are organized in a red-black tree =-=[2, 8]-=-, which is one of the efficient implementations of dictionaries with a complexity of O(log n) per operation, where n is the number of elements in the tree. To summarize, we use a red-black tree that h... |

1 |
Simple Symbolic Bisimulations
- Engberg
(Show Context)
Citation Context ...ob. 1 Introduction The need for validity checking or optimal simplification of first order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of value-passing calculi =-=[4, 9, 15]-=-. The NP-completeness of checking satisfiability of propositional formulas [3] implies that validity checking of that class of formulas is co-NP complete. Additionally, checking of quantified formulas... |

1 | Efficient Reduction of Bisimulation Formulas - Engberg, Larsen - 1993 |

1 |
Symbolic Bismulations
- Hennessy, Lin
- 1992
(Show Context)
Citation Context ...ob. 1 Introduction The need for validity checking or optimal simplification of first order bisimulation formulas has arisen from recent work on symbolic bisimulation checking of value-passing calculi =-=[4, 9, 15]-=-. The NP-completeness of checking satisfiability of propositional formulas [3] implies that validity checking of that class of formulas is co-NP complete. Additionally, checking of quantified formulas... |

1 |
Notes on the formalization of logic
- Scott
- 1981
(Show Context)
Citation Context ... 0 (Cut) d) If \Gamma j= E and E j= E 0 then \Gamma j= E 0 (Trans) e) \Gamma j= E and \Gamma j= E 0 iff \Gamma j= EsE 0 (Conj) f) \Gamma; E j= E 0 iff \Gamma j= E ! E 0 (Imp) Proof Standard, see e.g. =-=[16]-=-. 2 In general, there is not any similar disjunction theorem allowing both introduction and elimination to the right. However, from the entailment theorems and a few tautologies, we get proposition 2.... |