pdf-format: |
|
@InProceedings{dorsch_et_al:LIPIcs:2017:7793, author = {Ulrich Dorsch and Stefan Milius and Lutz Schr{\"o}der and Thorsten Wi{\ss}mann}, title = {{Efficient Coalgebraic Partition Refinement}}, booktitle = {28th International Conference on Concurrency Theory (CONCUR 2017)}, pages = {32:1--32:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-048-4}, ISSN = {1868-8969}, year = {2017}, volume = {85}, editor = {Roland Meyer and Uwe Nestmann}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7793}, URN = {urn:nbn:de:0030-drops-77939}, doi = {10.4230/LIPIcs.CONCUR.2017.32}, annote = {Keywords: markov chains, deterministic finite automata, partition refinement, generic algorithm, paige-tarjan algorithm, transition systems} }
Keywords: | markov chains, deterministic finite automata, partition refinement, generic algorithm, paige-tarjan algorithm, transition systems | |
Seminar: | 28th International Conference on Concurrency Theory (CONCUR 2017) | |
Issue date: | 2017 | |
Date of publication: | 01.09.2017 |