https://github.com/fandreuz/bsc-thesis
BSc thesis, Computer Engineering
https://github.com/fandreuz/bsc-thesis
algorithms graph-algorithms graph-theory python
Last synced: 11 months ago
JSON representation
BSc thesis, Computer Engineering
- Host: GitHub
- URL: https://github.com/fandreuz/bsc-thesis
- Owner: fandreuz
- Created: 2020-07-23T14:45:49.000Z (almost 6 years ago)
- Default Branch: master
- Last Pushed: 2021-08-05T09:56:59.000Z (almost 5 years ago)
- Last Synced: 2025-01-21T12:32:51.820Z (over 1 year ago)
- Topics: algorithms, graph-algorithms, graph-theory, python
- Language: TeX
- Homepage:
- Size: 18.9 MB
- Stars: 2
- Watchers: 3
- Forks: 0
- Open Issues: 3
-
Metadata Files:
- Readme: readme.md
Awesome Lists containing this project
README
# My BSc thesis
### Title
`BisPy`: a Python package for the computation of the maximum bisimulation of
directed graphs.
### Summary
In this thesis I analyse three algorithms for the computation of maximum
bisimulation, which I also implemented in the Python package `BisPy` (available
[here](https://github.com/fAndreuzzi/BisPy)).
### PDF and slides
The PDF file is available [here](files/document.pdf) italian only. The slides
which I used during the discussion of the thesis are [here](files/slides.pdf).
### Word cloud
### Bibliography
This is a reduced version of the list of references which I consulted:
- Saha, Diptikalyan. "An incremental bisimulation algorithm." International
Conference on Foundations of Software Technology and Theoretical Computer
Science. Springer, Berlin, Heidelberg, 2007.
[DOI](https://doi.org/10.1007/978-3-540-77050-3_17)
- Dovier, Agostino, Carla Piazza, and Alberto Policriti. "A fast bisimulation
algorithm." International Conference on Computer Aided Verification.
Springer, Berlin, Heidelberg, 2001.
[DOI](https://doi.org/10.1007/3-540-44585-4_8)
- Gentilini, Raffaella, Carla Piazza, and Alberto Policriti. "From bisimulation
to simulation: Coarsest partition problems." Journal of Automated Reasoning
31.1 (2003): 73-103. [DOI](https://doi.org/10.1023/A:1027328830731)
- Paige, Robert, and Robert E. Tarjan. "Three partition refinement algorithms."
SIAM Journal on Computing 16.6 (1987): 973-989.
[DOI](https://doi.org/10.1137/0216062)
- Hopcroft, John. "An n log n algorithm for minimizing states in a finite
automaton." Theory of machines and computations. Academic Press, 1971.
189-196.
- Aczel, Peter. "Non-well-founded sets." (1988).
- Kanellakis, Paris C., and Scott A. Smolka. "CCS expressions, finite state
processes, and three problems of equivalence." Information and computation
86.1 (1990): 43-68. [DOI]()
- Sharir, Micha. "A strong-connectivity algorithm and its applications in data
flow analysis." Computers & Mathematics with Applications 7.1 (1981): 67-72.
[DOI]()
- Cormen, Thomas H., et al. Introduction to algorithms. MIT press, 2009.
(ISBN: 9780262533058)