EUVIMEDEUVIMED entdecken
Crossref

BehaVerify: A Formal Verification Tool for Behavior Trees

Serena S. Serbinowska, Ben Wooding, Diego Manzanas Lopez, Luke Nam, Anne M. Tumlin, Nicholas K. Potteiger, Hongchao Zhang, Taylor T. Johnson

Electronic Proceedings in Theoretical Computer Science · 17.11.2026 · 457 · 91-109

DOI: 10.4204/eptcs.457.7 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 17.11.2026. Verfasst von Serena S. Serbinowska und 7 weiteren Autor:innen. Die Arbeit nennt 31 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Serbinowska, S. S., Wooding, B., Lopez, D. M., Nam, L., Tumlin, A. M., Potteiger, N. K., Zhang, H., & Johnson, T. T. (2026). BehaVerify: A Formal Verification Tool for Behavior Trees. Electronic Proceedings in Theoretical Computer Science, 457, 91-109. https://doi.org/10.4204/eptcs.457.7

Vancouver

Serbinowska SS, Wooding B, Lopez DM, Nam L, Tumlin AM, Potteiger NK, et al. BehaVerify: A Formal Verification Tool for Behavior Trees. Electronic Proceedings in Theoretical Computer Science. 2026;457:91-109. doi:10.4204/eptcs.457.7

BibTeX
@article{Serbinowska2026,
  author = {Serbinowska, Serena S. and Wooding, Ben and Lopez, Diego Manzanas and Nam, Luke and Tumlin, Anne M. and Potteiger, Nicholas K. and Zhang, Hongchao and Johnson, Taylor T.},
  title = {BehaVerify: A Formal Verification Tool for Behavior Trees},
  journal = {Electronic Proceedings in Theoretical Computer Science},
  year = {2026},
  volume = {457},
  pages = {91--109},
  doi = {10.4204/eptcs.457.7}
}
Kostenlos starten →