Commit 9976bd03 authored by Thorsten Wißmann's avatar Thorsten Wißmann 🐧

Reorder material

parent 803b8aa0
......@@ -9,20 +9,19 @@ The genericity of copar stems from the coalgebraic approach and covers the minim
- and *combinations* thereof (under derived bismilarity notions, e.g. backwards bisimilarity for weighted tree automata).
The algorithm runs in *O(m log n)* on a system with *n* states and *m*
transitions and has been developed in a series of publications, see the [literature file](doc/literature.md).
transitions.
## Usage
Installation instructions can be found in the [install file](INSTALL.md).
The core partition-refinement algorithm can be called by
Command line syntax is described in `copar --help` and the input
file syntax in `copar help`. The core partition-refinement algorithm can be
called by
./copar refine FILENAME
Examples for input files are in the directory `examples/`.
Command line syntax is described in `copar --help` and the input
file syntax in `copar help`.
## Benchmarks
Extensive benchmarks of CoPaR on different input files can be found at
......@@ -30,3 +29,18 @@ Extensive benchmarks of CoPaR on different input files can be found at
Micro-Benchmarks for internal data structures and routines are available in the
`bench/` directory and can be executed with `stack bench`.
## Literature
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)
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)
# Literature
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)
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)
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