pdf-format: |
|
@InProceedings{bouyer_et_al:LIPIcs:2008:1339, author = {Patricia Bouyer and Nicolas Markey and Jo{\"e}l Ouaknine and Philippe Schnoebelen and James Worrell}, title = {{On Termination for Faulty Channel Machines}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {121--132}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-06-4}, ISSN = {1868-8969}, year = {2008}, volume = {1}, editor = {Susanne Albers and Pascal Weil}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1339}, URN = {urn:nbn:de:0030-drops-13390}, doi = {10.4230/LIPIcs.STACS.2008.1339}, annote = {Keywords: Automated Verification, Computational Complexity} }
Keywords: | Automated Verification, Computational Complexity | |
Seminar: | 25th International Symposium on Theoretical Aspects of Computer Science | |
Issue date: | 2008 | |
Date of publication: | 06.02.2008 |