An Incremental Bisimulation Algorithm

DOI10.1007/978-3-540-77050-3_17zbMath1135.68500OpenAlexW1854661526MaRDI QIDQ5458835

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 theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Computing the Maximum Bisimulation with Spiking Neural P Systems ⋮ A formal verification technique for behavioural model-to-model transformations ⋮ Computation of the greatest simulations and bisimulations between fuzzy automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symbolic bisimulations
• CCS expressions, finite state processes, and three problems of equivalence
• A linear time solution to the single function coarsest partition problem
• A strong-connectivity algorithm and its applications in data flow analysis
• An efficient algorithm for computing bisimulation equivalence
• Three Partition Refinement Algorithms
• Adaptive functional programming
• Logic Programming
• A Local Algorithm for Incremental Evaluation of Tabled Logic Programs

This page was built for publication: An Incremental Bisimulation Algorithm