Mila E. Majster-Cederbaum, Christoph Minnameier. Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets. In Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková, editors, SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings. Volume 4910 of Lecture Notes in Computer Science, pages 352-363, Springer, 2008. [doi]
@inproceedings{Majster-CederbaumM08:1,
title = {Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets},
author = {Mila E. Majster-Cederbaum and Christoph Minnameier},
year = {2008},
doi = {10.1007/978-3-540-77566-9_30},
url = {http://dx.doi.org/10.1007/978-3-540-77566-9_30},
tags = {e-science},
researchr = {https://researchr.org/publication/Majster-CederbaumM08%3A1},
cites = {0},
citedby = {0},
pages = {352-363},
booktitle = {SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings},
editor = {Viliam Geffert and Juhani Karhumäki and Alberto Bertoni and Bart Preneel and Pavol Návrat and Mária Bieliková},
volume = {4910},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-77565-2},
}