论文标题
加权LTL公式转换为加权的Büchi自动机，超过ω值单体
A translation of weighted LTL formulas to weighted Büchi automata over ω-valuation monoids
论文作者
论文摘要
在本文中，我们在产品$ω$评估上引入了一个加权LTL，该$ω$值是满足特定属性的。 We also introduce weighted generalized Büchi automata with $\varepsilon$-transitions, as well as weighted Büchi automata with $\varepsilon$-transitions over product $ω$-valuation monoids and prove that these two models are expressively equivalent and also equivalent to weighted Büchi automata already introduced in the literature.我们证明，我们逻辑的句法片段的每个公式都可以通过$ \ varepsilon $ - 过渡有效地转化为加权的广义büchi自动机。对于一般产品$ω$ - 流量的单型，它可以满足特定属性，我们定义了加权LTL，加权的广义Büchi自动机，并使用$ \ varepsilon $ - 过渡和加权的büchiautomata和$ \ \ \ varepsilon $ - transitions，我们证明了aforeentioned $ $ formenties $ $ $。现在，使用$ \ varepsilon $ - 转换将加权LTL公式转换为加权的广义Büchi自动机，现在可以用于逻辑的受限语法片段。
In this paper we introduce a weighted LTL over product $ω$-valuation monoids that satisfy specific properties. We also introduce weighted generalized Büchi automata with $\varepsilon$-transitions, as well as weighted Büchi automata with $\varepsilon$-transitions over product $ω$-valuation monoids and prove that these two models are expressively equivalent and also equivalent to weighted Büchi automata already introduced in the literature. We prove that every formula of a syntactic fragment of our logic can be effectively translated to a weighted generalized Büchi automaton with $\varepsilon$-transitions. For generalized product $ω$-valuation monoids that satisfy specific properties we define a weighted LTL, weighted generalized Büchi automata with $\varepsilon$-transitions, and weighted Büchi automata with $\varepsilon$-transitions, and we prove the aforementioned results for generalized product $ω$-valuation monoids as well. The translation of weighted LTL formulas to weighted generalized Büchi automata with $\varepsilon$-transitions is now obtained for a restricted syntactical fragment of the logic.
