Scholarlink

As with automata on infinite words and finite trees, automata as studied in the previous chapter provide a relatively simple computational model for specifying properties of infinite trees. Such trees can be seen as abstractions of runs of reactive programs for instance, for which the exact next step is not predetermined (as in infinite words) but may depend on some external input.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Logics on Infinite Trees

  • 章节

  • 发表日期：

    2025年

查看全文
  • Martin Hofmann,
  • Martin Lange

摘要

As with automata on infinite words and finite trees, automata as studied in the previous chapter provide a relatively simple computational model for specifying properties of infinite trees. Such trees can be seen as abstractions of runs of reactive programs for instance, for which the exact next step is not predetermined (as in infinite words) but may depend on some external input.