{"title":"Partial Order Reductions for Bisimulation Checking","date_updated":"2022-01-06T06:59:07Z","citation":{"bibtex":"@inproceedings{Huhn_Niebert_Wehrheim_1998, series={Lecture Notes in Computer Science}, title={Partial Order Reductions for Bisimulation Checking}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>}, booktitle={Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings}, author={Huhn, Michaela and Niebert, Peter and Wehrheim, Heike}, editor={Arvind, Vikraman and Ramanujam, RamaswamyEditors}, year={1998}, pages={271--282}, collection={Lecture Notes in Computer Science} }","short":"M. Huhn, P. Niebert, H. Wehrheim, in: V. Arvind, R. Ramanujam (Eds.), Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings, 1998, pp. 271--282.","mla":"Huhn, Michaela, et al. “Partial Order Reductions for Bisimulation Checking.” <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, edited by Vikraman Arvind and Ramaswamy Ramanujam, 1998, pp. 271--282, doi:<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>.","ama":"Huhn M, Niebert P, Wehrheim H. Partial Order Reductions for Bisimulation Checking. In: Arvind V, Ramanujam R, eds. <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>. Lecture Notes in Computer Science. ; 1998:271--282. doi:<a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">10.1007/978-3-540-49382-2_26</a>","ieee":"M. Huhn, P. Niebert, and H. Wehrheim, “Partial Order Reductions for Bisimulation Checking,” in <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, 1998, pp. 271--282.","chicago":"Huhn, Michaela, Peter Niebert, and Heike Wehrheim. “Partial Order Reductions for Bisimulation Checking.” In <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i>, edited by Vikraman Arvind and Ramaswamy Ramanujam, 271--282. Lecture Notes in Computer Science, 1998. <a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">https://doi.org/10.1007/978-3-540-49382-2_26</a>.","apa":"Huhn, M., Niebert, P., &#38; Wehrheim, H. (1998). Partial Order Reductions for Bisimulation Checking. In V. Arvind &#38; R. Ramanujam (Eds.), <i>Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings</i> (pp. 271--282). <a href=\"https://doi.org/10.1007/978-3-540-49382-2_26\">https://doi.org/10.1007/978-3-540-49382-2_26</a>"},"user_id":"29719","doi":"10.1007/978-3-540-49382-2_26","department":[{"_id":"77"}],"publication":"Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings","year":"1998","editor":[{"full_name":"Arvind, Vikraman","last_name":"Arvind","first_name":"Vikraman"},{"first_name":"Ramaswamy","last_name":"Ramanujam","full_name":"Ramanujam, Ramaswamy"}],"page":"271--282","type":"conference","series_title":"Lecture Notes in Computer Science","date_created":"2018-06-14T07:37:32Z","status":"public","author":[{"first_name":"Michaela","full_name":"Huhn, Michaela","last_name":"Huhn"},{"last_name":"Niebert","full_name":"Niebert, Peter","first_name":"Peter"},{"first_name":"Heike","last_name":"Wehrheim","full_name":"Wehrheim, Heike","id":"573"}],"_id":"3257"}