{"title":"用产品ω-评价单体上的加权LTL描述加权安全","authors":"Eleni Mandrali","doi":"10.7561/SACS.2023.2.93","DOIUrl":null,"url":null,"abstract":"We define the notion of k-safe infinitary series over idempotent ordered totally generalized product omega-valuation monoids that satisfy specific properties. For each element k of the underlying structure (different from the neutral elements of the additive, and the multiplicative operation) we determine two syntactic fragments of the weighted LTL with the property that the semantics of the formulas in these fragments are k-safe infinitary series. For specific idempotent ordered totally generalized product omega-valuation monoids we provide algorithms that given a weighted Buchi automaton and a weighted LTL formula in these fragments, decide whether the behavior of the automaton coincides with the semantics of the formula.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"100 11","pages":"93-157"},"PeriodicalIF":0.0000,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Describing weighted safety with weighted LTL over product omega-valuation monoids\",\"authors\":\"Eleni Mandrali\",\"doi\":\"10.7561/SACS.2023.2.93\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We define the notion of k-safe infinitary series over idempotent ordered totally generalized product omega-valuation monoids that satisfy specific properties. For each element k of the underlying structure (different from the neutral elements of the additive, and the multiplicative operation) we determine two syntactic fragments of the weighted LTL with the property that the semantics of the formulas in these fragments are k-safe infinitary series. For specific idempotent ordered totally generalized product omega-valuation monoids we provide algorithms that given a weighted Buchi automaton and a weighted LTL formula in these fragments, decide whether the behavior of the automaton coincides with the semantics of the formula.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"100 11\",\"pages\":\"93-157\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/SACS.2023.2.93\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2023.2.93","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
我们定义了在满足特定属性的幂级数上的 k 安全无穷级数概念。对于底层结构的每个元素 k（不同于加法运算和乘法运算的中性元素），我们确定了加权 LTL 的两个语法片段，这些片段中公式的语义具有 k 安全无穷级数的特性。对于特定的幂等有序完全广义积ω-估值单体，我们提供了给定加权布基自动机和这些片段中的加权 LTL 公式的算法，以判定自动机的行为是否与公式的语义相吻合。
Describing weighted safety with weighted LTL over product omega-valuation monoids
We define the notion of k-safe infinitary series over idempotent ordered totally generalized product omega-valuation monoids that satisfy specific properties. For each element k of the underlying structure (different from the neutral elements of the additive, and the multiplicative operation) we determine two syntactic fragments of the weighted LTL with the property that the semantics of the formulas in these fragments are k-safe infinitary series. For specific idempotent ordered totally generalized product omega-valuation monoids we provide algorithms that given a weighted Buchi automaton and a weighted LTL formula in these fragments, decide whether the behavior of the automaton coincides with the semantics of the formula.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
