Skip to content
GitLab
Menu
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Software
CoPaR
Commits
b576b10d
Commit
b576b10d
authored
Jul 02, 2020
by
Thorsten Wißmann
🐧
Browse files
More links in the README.md
parent
49f55c55
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
README.md
View file @
b576b10d
...
...
@@ -35,12 +35,12 @@ Micro-Benchmarks for internal data structures and routines are available in the
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
)
)
*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
)
-
[
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
[
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)
-
[
Hans-Peter Deifel
](
https://www8.cs.fau.de/deifel
)
,
[
Master's Thesis
](
https://hpdeifel.de/master-thesis-deifel.pdf
)
, 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
)
)
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:
-
[
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)
-
[
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)
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment
