An efficient algorithm for computing bisimulation equivalence

Dovier, Agostino; Piazza, Carla; Policriti, Alberto

doi:10.1016/s0304-3975(03)00361-x

Cited by 121 publications

(125 citation statements)

References 33 publications

Supporting

Mentioning

125

Contrasting

Order By: Relevance

“…We measured the performance of our algorithms by implementing those on top of the source code available from one of the author's website of [6]. The data structures used in their implementation was not changed.…”

Section: Resultsmentioning

confidence: 99%

“…Simple Binary Tree. This benchmark (Benchmark 2 of [6]) consists of a binary tree with 262143 nodes and has two different labels for left and right subtree as shown in Figure 2(a) with node numbers and initial blocks. The initial FBA time is 0.3s.…”

Section: Resultsmentioning

confidence: 99%

“…In the general case when the graph is not well-founded the ranking is done by SCC decomposition ( [6]) of the graph using Kosaraju and Sharir's SCC computation algorithm [22]. To find SCCs in a graph G, the algorithm first traverses G −1 , the transpose of G, and gives post-order numbers to the vertices in G. Then it traverses G, starting from the vertex with the highest post-order number; this traversal builds a spanning tree for one SCC of G. Whenever the traversal ends, the algorithm begins a new traversal from the unvisited vertex with the highest post-order number, thereby building a spanning tree for another SCC.…”

Section: Definition 1 Given Two Graphsmentioning

confidence: 99%

“…A non-incremental strategy can incorporate any changes in the graph by recomputing its coarsest partition again using the FBA [6] (from-scratch algorithm). However, such re-computation is often wasteful as small changes to the graph can potentially result into small changes to its coarsest partition.…”

Section: Incremental Bisimulation Algorithmmentioning

confidence: 99%

“…al. [6] known as fast bisimulation algorithm or FBA. PTA and FBA solve relational coarsest partition problem which is equivalent to finding maximum bisimulation relation of a graph.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

An Incremental Bisimulation Algorithm

Saha¹

2007

FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science

View full text Add to dashboard Cite

Abstract. The notion of bisimulation has been used in various fields including Modal Logic, Set theory, Formal Verification, and XML indexing. In this paper we present the first algorithm for incremental maintenance of maximum bisimulation relation of a graph with respect to changes in the graph. Given a graph, its maximum bisimulation relation, and the changes in the graph, we determine the maximum bisimulation relation with respect to the changed graph by computing the changes in the given bisimulation relation. When the change in the graph induces small changes in the maximum bisimulation relation, our incremental algorithm is able to update the bisimulation relation on average an order of magnitude faster than the fastest available non-incremental algorithm. Preliminary experiments demonstrate the effectiveness of our algorithm. Our algorithm finds extensive use in verification where the specification changes over time, and XML indexing in database where the index structure, obtained by bisimulation on XML graph structure, needs to be maintained with respect to changes in the XML documents.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

Section: Definition 1 Given Two Graphsmentioning

confidence: 99%

Section: Incremental Bisimulation Algorithmmentioning

confidence: 99%

“…al. [6] known as fast bisimulation algorithm or FBA. PTA and FBA solve relational coarsest partition problem which is equivalent to finding maximum bisimulation relation of a graph.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations