Skip to content
Snippets Groups Projects
Commit 36298426 authored by Thorsten Wißmann's avatar Thorsten Wißmann :penguin:
Browse files

Fix casing

parent bb063f8b
No related branches found
No related tags found
No related merge requests found
......@@ -32,7 +32,7 @@ Micro-Benchmarks for internal data structures and routines are available in the
## Literature
Coalgebraic Partition refinement:
On coalgebraic partition refinement:
- [Generic Partition Refinement and Weighted Tree Automata](https://link.springer.com/chapter/10.1007/978-3-030-30942-8_18) ([Hans-Peter Deifel](https://www8.cs.fau.de/deifel), [Stefan Milius](https://www8.cs.fau.de/milius), [Lutz Schröder](http://www8.informatik.uni-erlangen.de/schroeder/), [Thorsten Wißmann](http://www8.informatik.uni-erlangen.de/thorsten)) In: *Formal Methods – The Next 30 Years*, pp. 280–297 (Best Theory Paper Award) \[[PDF](https://link.springer.com/chapter/10.1007/978-3-030-30942-8_18)\] \[[Preprint PDF](https://arxiv.org/abs/1811.08850)\] \[[DOI: 10.1007/978-3-030-30942-8_18](https://dx.doi.org/10.1007/978-3-030-30942-8_18)\]
- [Efficient and Modular Coalgebraic Partition Refinement](https://lmcs.episciences.org/6064) ([Thorsten Wißmann](http://www8.informatik.uni-erlangen.de/thorsten), [Ulrich Dorsch](https://www8.cs.fau.de/ulrich), [Stefan Milius](https://www8.cs.fau.de/milius), [Lutz Schröder](http://www8.informatik.uni-erlangen.de/schroeder/)) In: *Logical Methods in Computer Science*, Volume 16, Issue 1 \[[PDF](https://lmcs.episciences.org/6064)\] \[[DOI: 10.23638/LMCS-16(1:8)2020](https://dx.doi.org/10.23638/LMCS-16(1:8)2020)\]
......@@ -40,7 +40,7 @@ Coalgebraic Partition refinement:
- Conference version of the above journal article: [Efficient Coalgebraic Partition Refinement](https://drops.dagstuhl.de/opus/volltexte/2017/7793/) ([Ulrich Dorsch](https://www8.cs.fau.de/ulrich), [Stefan Milius](https://www8.cs.fau.de/milius), [Lutz Schröder](http://www8.informatik.uni-erlangen.de/schroeder/), [Thorsten Wißmann](http://www8.informatik.uni-erlangen.de/thorsten)) In: *Proc. 28th International Conference on Concurrency Theory (CONCUR 2017)* \[[PDF](https://drops.dagstuhl.de/opus/volltexte/2017/7793/)\] \[[Preprint PDF](https://arxiv.org/abs/1705.08362)\] \[[DOI: 10.4230/LIPIcs.CONCUR.2017.32](https://dx.doi.org/10.4230/LIPIcs.CONCUR.2017.32)\]
On Reachability:
On reachability:
- [A Coalgebraic View on Reachability](https://arxiv.org/abs/1901.10717) ([Thorsten Wißmann](http://www8.informatik.uni-erlangen.de/thorsten), [Stefan Milius](https://www8.cs.fau.de/milius), [Shin-ya Katsumata](http://group-mmm.org/~s-katsumata/index-e.html), [Jérémy Dubut](http://group-mmm.org/~dubut/)) In: *Commentationes Mathematicae Universitatis Carolinae*, 60, 4, pp. 605-638 [Preprint PDF](https://arxiv.org/abs/1901.10717) [DOI: 10.14712/1213-7243.2019.026](https://dx.doi.org/10.14712/1213-7243.2019.026)
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment