%0 Conference Paper %1 balasubramanian:LIPIcs.CONCUR.2022.17 %A Balasubramanian, A. R. %B 33rd International Conference on Concurrency Theory (CONCUR 2022) %C Dagstuhl, Germany %D 2022 %E Klin, Bartek %E Lasota, Sławomir %E Muscholl, Anca %I Schloss Dagstuhl -- Leibniz-Zentrum für Informatik %K conference %P 17:1--17:19 %R 10.4230/LIPIcs.CONCUR.2022.17 %T Complexity of Coverability in Depth-Bounded Processes %U https://drops.dagstuhl.de/opus/volltexte/2022/17080 %V 243 %Z Keywords: \pi-calculus, Depth-bounded processes, Fast-growing complexity classes %@ 978-3-95977-246-4

@inproceedings{balasubramanian:LIPIcs.CONCUR.2022.17, added-at = {2023-09-24T18:46:04.000+0200}, address = {Dagstuhl, Germany}, annote = {Keywords: \pi-calculus, Depth-bounded processes, Fast-growing complexity classes}, author = {Balasubramanian, A. R.}, biburl = {https://www.bibsonomy.org/bibtex/29aed1e06ac54c5e5d4d014a4584824ed/paves}, booktitle = {33rd International Conference on Concurrency Theory (CONCUR 2022)}, doi = {10.4230/LIPIcs.CONCUR.2022.17}, editor = {Klin, Bartek and Lasota, S{\l}awomir and Muscholl, Anca}, interhash = {d804257ef6f7af6088d545f30db7aeb8}, intrahash = {9aed1e06ac54c5e5d4d014a4584824ed}, isbn = {978-3-95977-246-4}, issn = {1868-8969}, keywords = {conference}, pages = {17:1--17:19}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, timestamp = {2023-09-24T18:46:04.000+0200}, title = {{Complexity of Coverability in Depth-Bounded Processes}}, url = {https://drops.dagstuhl.de/opus/volltexte/2022/17080}, urn = {urn:nbn:de:0030-drops-170809}, volume = 243, year = 2022 }