An Incremental Bisimulation Algorithm
DOI10.1007/978-3-540-77050-3_17zbMATH Open1135.68500OpenAlexW1854661526MaRDI QIDQ5458835FDOQ5458835
Authors: Diptikalyan Saha 
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_17
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A strong-connectivity algorithm and its applications in data flow analysis
- Three Partition Refinement Algorithms
- CCS expressions, finite state processes, and three problems of equivalence
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient algorithm for computing bisimulation equivalence
- Symbolic bisimulations
- A linear time solution to the single function coarsest partition problem
- Adaptive functional programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logic Programming
- A Local Algorithm for Incremental Evaluation of Tabled Logic Programs
Cited In (6)
- A formal verification technique for behavioural model-to-model transformations
- Computation of the greatest simulations and bisimulations between fuzzy automata
- Nondeterministic automata: equivalence, bisimulations, and uniform relations
- A bisimulation for dynamic sealing
- Computing the Maximum Bisimulation with Spiking Neural P Systems
- Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
This page was built for publication: An Incremental Bisimulation Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458835)
