An Incremental Bisimulation Algorithm

DOI10.1007/978-3-540-77050-3_17MaRDI QIDQ5458835zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• scientific article; zbMATH DE number 1796125
• An efficient algorithm for computing bisimulation equivalence
• From bisimulation to simulation: Coarsest partition problems
• Bisimulations on Data Graphs
• Computing bisimulation-based comparisons

Cites work

• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 1142329 (Why is no real title available?)
• scientific article; zbMATH DE number 1796125 (Why is no real title available?)
• scientific article; zbMATH DE number 2085276 (Why is no real title available?)
• A Local Algorithm for Incremental Evaluation of Tabled Logic Programs
• A linear time solution to the single function coarsest partition problem
• A strong-connectivity algorithm and its applications in data flow analysis
• Adaptive functional programming
• An efficient algorithm for computing bisimulation equivalence
• CCS expressions, finite state processes, and three problems of equivalence
• Logic Programming
• Symbolic bisimulations
• Three Partition Refinement Algorithms

Cited in

(6)

• Computation of the greatest simulations and bisimulations between fuzzy automata
• A formal verification technique for behavioural model-to-model transformations
• Computing \(k\)-bisimulations for large graphs: a comparison and efficiency analysis
• Computing the Maximum Bisimulation with Spiking Neural P Systems
• Nondeterministic automata: equivalence, bisimulations, and uniform relations
• A bisimulation for dynamic sealing

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)