https://github.com/fandreuz/bsc-thesis
BSc thesis, Computer Engineering
Science Score: 26.0%
This score indicates how likely this project is to be science-related based on various indicators:
-
○CITATION.cff file
-
✓codemeta.json file
Found codemeta.json file -
○.zenodo.json file
-
✓DOI references
Found 12 DOI reference(s) in README -
○Academic publication links
-
○Committers with academic emails
-
○Institutional organization owner
-
○JOSS paper metadata
-
○Scientific vocabulary similarity
Low similarity (6.8%) to scientific vocabulary
Keywords
algorithms
graph-algorithms
graph-theory
python
Last synced: 4 months ago
·
JSON representation
Repository
BSc thesis, Computer Engineering
Basic Info
Statistics
- Stars: 2
- Watchers: 2
- Forks: 0
- Open Issues: 3
- Releases: 14
Topics
algorithms
graph-algorithms
graph-theory
python
Created over 5 years ago
· Last pushed over 4 years ago
Metadata Files
Readme
readme.md
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).
PDF and slides
The PDF file is available here italian only. The slides which I used during the discussion of the thesis are here.
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
- Dovier, Agostino, Carla Piazza, and Alberto Policriti. "A fast bisimulation algorithm." International Conference on Computer Aided Verification. Springer, Berlin, Heidelberg, 2001. DOI
- Gentilini, Raffaella, Carla Piazza, and Alberto Policriti. "From bisimulation to simulation: Coarsest partition problems." Journal of Automated Reasoning 31.1 (2003): 73-103. DOI
- Paige, Robert, and Robert E. Tarjan. "Three partition refinement algorithms." SIAM Journal on Computing 16.6 (1987): 973-989. DOI
- 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)
Owner
- Name: Francesco Andreuzzi
- Login: fandreuz
- Kind: user
- Location: Geneva, Switzerland
- Company: CERN
- Repositories: 1
- Profile: https://github.com/fandreuz
CSE MSc student | SWE @cern
GitHub Events
Total
Last Year
Committers
Last synced: 7 months ago
Top Committers
| Name | Commits | |
|---|---|---|
| francescoandreuzzi | a****o@g****m | 420 |
| Alberto Casagrande | a****e@u****t | 1 |
Committer Domains (Top 20 + Academic)
units.it: 1
Issues and Pull Requests
Last synced: 7 months ago
All Time
- Total issues: 0
- Total pull requests: 13
- Average time to close issues: N/A
- Average time to close pull requests: less than a minute
- Total issue authors: 0
- Total pull request authors: 1
- Average comments per issue: 0
- Average comments per pull request: 0.08
- Merged pull requests: 13
- Bot issues: 0
- Bot pull requests: 0
Past Year
- Issues: 0
- Pull requests: 0
- Average time to close issues: N/A
- Average time to close pull requests: N/A
- Issue authors: 0
- Pull request authors: 0
- Average comments per issue: 0
- Average comments per pull request: 0
- Merged pull requests: 0
- Bot issues: 0
- Bot pull requests: 0
Top Authors
Issue Authors
Pull Request Authors
- fandreuz (11)