Commit 1b2eb48e authored by Thorsten Wißmann's avatar Thorsten Wißmann 🐧

Format literature.

parent b78e032b
......@@ -2,12 +2,13 @@
Coalgebraic Partition refinement:
- Generic Partition Refinement and Weighted Tree Automata (Hans-Peter Deifel, Stefan Milius, Lutz Schröder, Thorsten Wißmann) In: Formal Methods – The Next 30 Years, pp. 280–297 [DOI: 10.1007/978-3-030-30942-8_18]
- Hans-Peter Deifel, Master's Thesis, 2019
- Efficient and Modular Coalgebraic Partition Refinement (Thorsten Wißmann, Ulrich Dorsch, Stefan Milius, Lutz Schröder) In: Logical Methods in Computer Science, Volume 16, Issue 1 [DOI: 10.23638/LMCS-16(1:8)2020]
- Conference version of the above journal article: Efficient Coalgebraic Partition Refinement (Ulrich Dorsch, Stefan Milius, Lutz Schröder, Thorsten Wißmann) In: Proc. 28th International Conference on Concurrency Theory (CONCUR 2017) [DOI: 10.4230/LIPIcs.CONCUR.2017.32]
- [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)) *Formal Methods – The Next 30 Years*, pp. 280–297 [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/)) *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)
- Hans-Peter Deifel, Master's Thesis, 2019
- 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)) *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:
- A Coalgebraic View on Reachability (Thorsten Wißmann, Stefan Milius, Shin-ya Katsumata, Jérémy Dubut) In: Commentationes Mathematicae Universitatis Carolinae, 60, 4, pp. 605-638
- [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/)) *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)
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment